Matthew Harrison-Trainor

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 36

Top Topics

Probabilistic Reasoning

Algebraic Structures

Fundamental Questions

Top Venues

Ann. Pure Appl. Log.

Publications

Matthew Harrison-Trainor, Syed Akbari
Computable learning of natural hypothesis classes. CoRR (2024)
Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky
Enumerations of families closed under finite differences. Comput. 13 (1) (2024)
Matthew Harrison-Trainor, Patrick Lutz
Coding information into all infinite subsets of a dense set. CoRR (2023)
Will Boney, Barbara F. Csima, Nancy A. Day, Matthew Harrison-Trainor
Which Classes of Structures Are Both Pseudo-Elementary and Definable by an Infinitary Sentence? Bull. Symb. Log. 29 (1) (2023)
Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov
Computable Stone spaces. Ann. Pure Appl. Log. 174 (9) (2023)
Matthew Harrison-Trainor, Antonio Montalbán
The Tree of Tuples of a Structure. J. Symb. Log. 87 (1) (2022)
Matthew Harrison-Trainor
An Introduction to the Scott Complexity of Countable Structures and a Survey of Recent Results. Bull. Symb. Log. 28 (1) (2022)
Matthew Harrison-Trainor
An analysis of random elections with large numbers of voters. Math. Soc. Sci. 116 (2022)
Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87 (1) (2022)
Rod Downey, Matthew Harrison-Trainor
A Minimal Set Low for Speed. J. Symb. Log. 87 (4) (2022)
Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky
Scott Complexity of Countable Structures. J. Symb. Log. 86 (4) (2021)
Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky
Non-density in punctual computability. Ann. Pure Appl. Log. 172 (9) (2021)
Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III
Preferential Structures for Comparative Probabilistic Reasoning. CoRR (2021)
Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
Some Questions of Uniformity in Algorithmic Randomness. J. Symb. Log. 86 (4) (2021)
Matthew Harrison-Trainor, Meng-Che Turbo Ho
Finitely generated groups are universal among finitely generated structures. Ann. Pure Appl. Log. 172 (1) (2021)
Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
Some Questions of Uniformity in Algorithmic Randomness. CoRR (2021)
Uri Andrews, Matthew Harrison-Trainor, Noah Schweber
The property "arithmetic-is-recursive" on a cone. J. Math. Log. 21 (3) (2021)
Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud
Degrees of categoricity above limit ordinals. Comput. 9 (2) (2020)
Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112 (2020)
Yifeng Ding, Matthew Harrison-Trainor, Wesley H. Holliday
The Logic of Comparative Cardinality. J. Symb. Log. 85 (3) (2020)
Matthew Harrison-Trainor
An Analysis of Random Elections with Large Numbers of Voters. CoRR (2020)
Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng
Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. 85 (4) (2020)
Matthew Harrison-Trainor
A first-order theory of Ulm type. Comput. 8 (3-4) (2019)
Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. 84 (4) (2019)
Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky
Effective aspects of algorithmically random structures. Comput. 8 (3-4) (2019)
Matthew Harrison-Trainor
First-order possibility Models and Finitary Completeness Proofs. Rev. Symb. Log. 12 (4) (2019)
Matthew Harrison-Trainor
Left-orderable Computable Groups. J. Symb. Log. 83 (1) (2018)
Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III
Inferring probability comparisons. Math. Soc. Sci. 91 (2018)
Matthew Harrison-Trainor, Russell G. Miller, Antonio Montalbán
Borel Functors and Infinitary Interpretations. J. Symb. Log. 83 (4) (2018)
Matthew Harrison-Trainor
There is no classification of the decidably presentable structures. J. Math. Log. 18 (2) (2018)
Matthew Harrison-Trainor
Computable valued fields. Arch. Math. Log. 57 (5-6) (2018)
Matthew Harrison-Trainor
The Complexity of Countable Structures. Bull. Symb. Log. 24 (4) (2018)
Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán
Computable Functors and Effective interpretability. J. Symb. Log. 82 (1) (2017)
Barbara F. Csima, Matthew Harrison-Trainor
Degrees of Categoricity on a cone via η-Systems. J. Symb. Log. 82 (1) (2017)
Matthew Harrison-Trainor
The Gamma question for many-one degrees. Ann. Pure Appl. Log. 168 (7) (2017)
Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III
Preferential Structures for Comparative Probabilistic Reasoning. AAAI (2017)
Zoé Chatzidakis, Matthew Harrison-Trainor, Rahim Moosa
Differential-Algebraic jet Spaces Preserve Internality to the Constants. J. Symb. Log. 80 (3) (2015)