| Publication | Date of Publication | Type |
|---|
| Iterated priority arguments in descriptive set theory | 2024-11-12 | Paper |
| An arithmetic analysis of closed surfaces | 2024-07-04 | Paper |
| Enumerations of families closed under finite differences | 2024-04-15 | Paper |
| Computable Stone spaces | 2023-07-26 | Paper |
| Coding information into all infinite subsets of a dense set | 2023-06-01 | Paper |
| WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE? | 2023-03-20 | Paper |
| A MINIMAL SET LOW FOR SPEED | 2022-11-18 | Paper |
| Iterated Priority Arguments in Descriptive Set Theory | 2022-11-15 | Paper |
| An Effective Classification of Borel Wadge Classes | 2022-11-15 | Paper |
| The Logic of Cardinality Comparison Without the Axiom of Choice | 2022-11-07 | Paper |
| Infinitary Logic Has No Expressive Efficiency Over Finitary Logic | 2022-09-12 | Paper |
| An analysis of random elections with large numbers of voters | 2022-04-21 | Paper |
| THE TREE OF TUPLES OF A STRUCTURE | 2022-04-12 | Paper |
| RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS | 2022-04-12 | Paper |
| AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS | 2022-04-04 | Paper |
| SCOTT COMPLEXITY OF COUNTABLE STRUCTURES | 2022-01-17 | Paper |
| SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS | 2022-01-17 | Paper |
| The property “arithmetic-is-recursive” on a cone | 2021-11-03 | Paper |
| Some Questions of Uniformity in Algorithmic Randomness | 2021-11-02 | Paper |
| Computing sets from all infinite subsets | 2021-10-21 | Paper |
| Relativizing computable categoricity | 2021-07-28 | Paper |
| Non-density in punctual computability | 2021-07-26 | Paper |
| COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM | 2021-04-15 | Paper |
| Preferential Structures for Comparative Probabilistic Reasoning | 2021-04-06 | Paper |
| THE LOGIC OF COMPARATIVE CARDINALITY | 2021-03-19 | Paper |
| A minimal set low for speed | 2020-11-18 | Paper |
| Degrees of categoricity above limit ordinals | 2020-11-09 | Paper |
| Finitely generated groups are universal among finitely generated structures | 2020-10-13 | Paper |
| Graphs are not universal for online computability | 2020-06-09 | Paper |
| Constructing decidable graphs from decidable structures | 2020-02-28 | Paper |
| Optimal bounds for single-source Kolmogorov extractors | 2020-02-26 | Paper |
| FIRST-ORDER POSSIBILITY MODELS AND FINITARY COMPLETENESS PROOFS | 2020-02-20 | Paper |
| A first-order theory of Ulm type | 2020-01-17 | Paper |
| Effective aspects of algorithmically random structures | 2020-01-17 | Paper |
| AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES | 2020-01-10 | Paper |
| Characterizations of cancellable groups | 2019-07-17 | Paper |
| Relationships between computability-theoretic properties of problems | 2019-03-11 | Paper |
| Degree Spectra of Relations on a Cone | 2019-01-11 | Paper |
| BOREL FUNCTORS AND INFINITARY INTERPRETATIONS | 2019-01-04 | Paper |
| There is no classification of the decidably presentable structures | 2018-12-20 | Paper |
| Characterizations of Cancellable Groups | 2018-09-19 | Paper |
| Computable valued fields | 2018-08-16 | Paper |
| Which Classes of Structures Are Both Pseudo-elementary and Definable by an Infinitary Sentence? | 2018-08-05 | Paper |
| On optimal Scott sentences of finitely generated algebraic structures | 2018-08-02 | Paper |
| Inferring probability comparisons | 2018-07-03 | Paper |
| Scott ranks of models of a theory | 2018-06-22 | Paper |
| LEFT-ORDERABLE COMPUTABLE GROUPS | 2018-05-02 | Paper |
| Some new computable structures of high rank | 2018-04-20 | Paper |
| On Computable Field Embeddings and Difference Closed Fields | 2017-12-13 | Paper |
| Scott Ranks of Classifications of the Admissibility Equivalence Relation | 2017-12-03 | Paper |
| DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS | 2017-06-01 | Paper |
| COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY | 2017-06-01 | Paper |
| The gamma question for many-one degrees | 2017-05-15 | Paper |
| On optimal Scott sentences of finitely generated algebraic structures | 2017-02-21 | Paper |
| Borel Functors and Infinitary Interpretations | 2016-06-23 | Paper |
| A note on cancellation axioms for comparative probability | 2016-03-10 | Paper |
| DIFFERENTIAL-ALGEBRAIC JET SPACES PRESERVE INTERNALITY TO THE CONSTANTS | 2015-11-09 | Paper |
| Independence in computable algebra | 2015-09-25 | Paper |
| Nonstandard methods for bounds in differential polynomial rings | 2012-11-08 | Paper |
| Computable Gelfand Duality | N/A | Paper |
| Two results on complexities of decision problems of groups | N/A | Paper |
| Back-and-forth equivalent group von Neumann algebras | N/A | Paper |
