Matthew Harrison-Trainor

Dhruv Kulshreshtha

Ann. Pure Appl. Log., 2025

2024

Computable learning of natural hypothesis classes.

[BibT_eX]

[DOI]

Syed Akbari

CoRR, 2024

Enumerations of families closed under finite differences.

[BibT_eX]

[DOI]

Joseph S. Miller

Comput., 2024

Iterated Priority Arguments in Descriptive Set Theory.

[BibT_eX]

[DOI]

Adam R. Day

Bull. Symb. Log., 2024

2023

Computable Stone spaces.

[BibT_eX]

[DOI]

Nikolay Bazhenov

Ann. Pure Appl. Log., October, 2023

Which Classes of Structures Are Both Pseudo-Elementary and Definable by an Infinitary Sentence?

[BibT_eX]

[DOI]

Will Boney

Nancy A. Day

Bull. Symb. Log., March, 2023

Coding information into all infinite subsets of a dense set.

[BibT_eX]

[DOI]

Patrick Lutz

CoRR, 2023

2022

A Minimal Set Low for Speed.

[BibT_eX]

[DOI]

Rod Downey

J. Symb. Log., December, 2022

An analysis of random elections with large numbers of voters.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2022

The Tree of Tuples of a Structure.

[BibT_eX]

[DOI]

Antonio Montalbán

J. Symb. Log., 2022

Relationships between Computability-Theoretic Properties of Problems.

[BibT_eX]

[DOI]

Rod Downey

Ludovic Patey

J. Symb. Log., 2022

An Introduction to the Scott Complexity of Countable Structures and a Survey of Recent Results.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2022

2021

Some Questions of Uniformity in Algorithmic Randomness.

[BibT_eX]

[DOI]

Laurent Bienvenu

J. Symb. Log., 2021

Scott Complexity of Countable Structures.

[BibT_eX]

[DOI]

Rachael Alvir

J. Symb. Log., 2021

The property "arithmetic-is-recursive" on a cone.

[BibT_eX]

[DOI]

Uri Andrews

Noah Schweber

J. Math. Log., 2021

Finitely generated groups are universal among finitely generated structures.

[BibT_eX]

[DOI]

Meng-Che Turbo Ho

Ann. Pure Appl. Log., 2021

Non-density in punctual computability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2021

2020

Computability of Polish Spaces up to Homeomorphism.

[BibT_eX]

[DOI]

Keng Meng Ng

J. Symb. Log., 2020

The Logic of Comparative Cardinality.

[BibT_eX]

[DOI]

Yifeng Ding

Wesley H. Holliday

J. Symb. Log., 2020

Graphs are not universal for online computability.

[BibT_eX]

[DOI]

Rodney G. Downey

Iskander Sh. Kalimullin

Daniel Turetsky

J. Comput. Syst. Sci., 2020

Degrees of categoricity above limit ordinals.

[BibT_eX]

[DOI]

Michael Deveau

Mohammad Assem Mahmoud

Comput., 2020

2019

First-order possibility Models and Finitary Completeness Proofs.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2019

Automatic and Polynomial-Time Algebraic Structures.

[BibT_eX]

[DOI]

Nikolay Bazhenov

Iskander Sh. Kalimullin

Keng Meng Ng

J. Symb. Log., 2019

Effective aspects of algorithmically random structures.

[BibT_eX]

[DOI]

Bakh Khoussainov

Daniel Turetsky

Comput., 2019

A first-order theory of Ulm type.

[BibT_eX]

[DOI]

Comput., 2019

2018

Inferring probability comparisons.

[BibT_eX]

[DOI]

Wesley H. Holliday

Thomas F. Icard III

Math. Soc. Sci., 2018

Borel Functors and Infinitary Interpretations.

[BibT_eX]

[DOI]

Russell G. Miller

Antonio Montalbán

J. Symb. Log., 2018

Left-orderable Computable Groups.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

There is no classification of the decidably presentable structures.

[BibT_eX]

[DOI]

J. Math. Log., 2018

The Complexity of Countable Structures.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2018

Computable valued fields.

[BibT_eX]

[DOI]

Arch. Math. Log., 2018

2017

Computable Functors and Effective interpretability.

[BibT_eX]

[DOI]

Russell G. Miller

Antonio Montalbán

J. Symb. Log., 2017

Degrees of Categoricity on a cone via η-Systems.

[BibT_eX]

[DOI]

J. Symb. Log., 2017

The Gamma question for many-one degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2017

Preferential Structures for Comparative Probabilistic Reasoning.

[BibT_eX]

[DOI]

Wesley H. Holliday

Thomas F. Icard III

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2015

Differential-Algebraic jet Spaces Preserve Internality to the Constants.

[BibT_eX]

[DOI]

Zoé Chatzidakis