Matthew Harrison-Trainor

42 papers A* 2Journal 40

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Computable learning of natural hypothesis classes. COLT Syed Akbari, Matthew Harrison-Trainor
2025	J	`jnl`	Dichotomy results for classes of countable graphs. CoRR Vittorio Cipriani, Ekaterina Fokina, Matthew Harrison-Trainor, Liling Ko, Dino Rossegger
2025	J	`jnl`	The logic of cardinality comparison without the axiom of choice. Ann. Pure Appl. Log. Matthew Harrison-Trainor, Dhruv Kulshreshtha
2025	J	`jnl`	Two results on complexities of decision problems of groups. Int. J. Algebra Comput. Uri Andrews, Matthew Harrison-Trainor, Meng-Che Ho
2024	J	`jnl`	Computable learning of natural hypothesis classes. CoRR Matthew Harrison-Trainor, Syed Akbari
2024	J	`jnl`	Enumerations of families closed under finite differences. Comput. Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky
2024	J	`jnl`	Iterated Priority Arguments in Descriptive Set Theory. Bull. Symb. Log. Adam R. Day, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky
2023	J	`jnl`	Coding information into all infinite subsets of a dense set. CoRR Matthew Harrison-Trainor, Patrick Lutz
2023	J	`jnl`	Computable Stone spaces. Ann. Pure Appl. Log. Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov
2023	J	`jnl`	Which Classes of Structures Are Both Pseudo-Elementary and Definable by an Infinitary Sentence? Bull. Symb. Log. Will Boney, Barbara F. Csima, Nancy A. Day, Matthew Harrison-Trainor
2022	J	`jnl`	A Minimal Set Low for Speed. J. Symb. Log. Rod Downey, Matthew Harrison-Trainor
2022	J	`jnl`	An Introduction to the Scott Complexity of Countable Structures and a Survey of Recent Results. Bull. Symb. Log. Matthew Harrison-Trainor
2022	J	`jnl`	An analysis of random elections with large numbers of voters. Math. Soc. Sci. Matthew Harrison-Trainor
2022	J	`jnl`	Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky
2022	J	`jnl`	The Tree of Tuples of a Structure. J. Symb. Log. Matthew Harrison-Trainor, Antonio Montalbán
2021	J	`jnl`	Finitely generated groups are universal among finitely generated structures. Ann. Pure Appl. Log. Matthew Harrison-Trainor, Meng-Che Turbo Ho
2021	J	`jnl`	Non-density in punctual computability. Ann. Pure Appl. Log. Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky
2021	J	`jnl`	Preferential Structures for Comparative Probabilistic Reasoning. CoRR Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III
2021	J	`jnl`	Scott Complexity of Countable Structures. J. Symb. Log. Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky
2021	J	`jnl`	Some Questions of Uniformity in Algorithmic Randomness. CoRR Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
2021	J	`jnl`	Some Questions of Uniformity in Algorithmic Randomness. J. Symb. Log. Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
2021	J	`jnl`	The property "arithmetic-is-recursive" on a cone. J. Math. Log. Uri Andrews, Matthew Harrison-Trainor, Noah Schweber
2020	J	`jnl`	An Analysis of Random Elections with Large Numbers of Voters. CoRR Matthew Harrison-Trainor
2020	J	`jnl`	Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng
2020	J	`jnl`	Degrees of categoricity above limit ordinals. Comput. Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud
2020	J	`jnl`	Graphs are not universal for online computability. J. Comput. Syst. Sci. Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky
2020	J	`jnl`	The Logic of Comparative Cardinality. J. Symb. Log. Yifeng Ding, Matthew Harrison-Trainor, Wesley H. Holliday
2019	J	`jnl`	A first-order theory of Ulm type. Comput. Matthew Harrison-Trainor
2019	J	`jnl`	Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
2019	J	`jnl`	Effective aspects of algorithmically random structures. Comput. Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky
2019	J	`jnl`	First-order possibility Models and Finitary Completeness Proofs. Rev. Symb. Log. Matthew Harrison-Trainor
2018	J	`jnl`	Borel Functors and Infinitary Interpretations. J. Symb. Log. Matthew Harrison-Trainor, Russell G. Miller, Antonio Montalbán
2018	J	`jnl`	Computable valued fields. Arch. Math. Log. Matthew Harrison-Trainor
2018	J	`jnl`	Inferring probability comparisons. Math. Soc. Sci. Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III
2018	J	`jnl`	Left-orderable Computable Groups. J. Symb. Log. Matthew Harrison-Trainor
2018	J	`jnl`	The Complexity of Countable Structures. Bull. Symb. Log. Matthew Harrison-Trainor
2018	J	`jnl`	There is no classification of the decidably presentable structures. J. Math. Log. Matthew Harrison-Trainor
2017	J	`jnl`	Computable Functors and Effective interpretability. J. Symb. Log. Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán
2017	J	`jnl`	Degrees of Categoricity on a cone via η-Systems. J. Symb. Log. Barbara F. Csima, Matthew Harrison-Trainor
2017	A*	`conf`	Preferential Structures for Comparative Probabilistic Reasoning. AAAI Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III
2017	J	`jnl`	The Gamma question for many-one degrees. Ann. Pure Appl. Log. Matthew Harrison-Trainor
2015	J	`jnl`	Differential-Algebraic jet Spaces Preserve Internality to the Constants. J. Symb. Log. Zoé Chatzidakis, Matthew Harrison-Trainor, Rahim Moosa