-
The logic of cardinality comparison without the axiom of choice (with Dhruv Kulshreshtha)
Submitted for publication. [ pdf ]
-
An effective classification of Borel Wadge classes (with Adam Day, Noam Greenberg, and Dan Turetsky)
Submitted for publication. [ pdf ]
-
Enumerations of families closed under finite differences (with Noam Greenberg, Joe Miller, and Dan Turetsky)
Submitted for publication. [ pdf ]
-
There is no simple characterization of the relatively decidable theories
Submitted for publication. [ pdf ]
-
Describing finitely presented algebraic structures
Submitted for publication. [ pdf ]
-
A representation theorem for possibility models
Submitted for publication. [ pdf ]
-
Coding information into all infinite subsets of a dense set (with Lu Liu and Patrick Lutz)
Israel Journal of Mathematics, to appear. [ pdf ]
-
Infinitary logic has no expressive efficiency over finitary logic (with Miles Kretschmer)
Journal of Symbolic Logic, to appear. [ pdf ]
-
An arithmetical characterization of closed surfaces (with Alexander Melnikov)
Transactions of the AMS, to appear. [ pdf ]
-
Iterated priority arguments in descriptive set theory (with Adam Day, Noam Greenberg, and Dan Turetsky)
Bulletin of Symbolic Logic, to appear. [ pdf ]
-
Computable Stone spaces (with Nikolay Bazhenov and Alexander Melnikov)
Annals of Pure and Applied Logic, 174 (2023), no. 9, 103304, 25 pp. [ pdf | DOI ]
-
A minimal set low for speed (with Rod Downey)
Journal of Symbolic Logic, 87 (2022), no. 4, 1693–1728. [ pdf | DOI ]
-
An analysis of random elections with large numbers of voters
Mathematical Social Sciences, 116 (2022), 68–84. [ pdf | DOI ]
-
Which classes of structures are both pseudo-elementary and \(\mathcal{L}_{\omega_1 \omega}\)-elementary? (with Will Boney, Barbara Csima and Nancy Day)
Bulletin of Symbolic Logic, 29 (2022), no. 1, 1–18. [ pdf | DOI ]
-
An introduction to the Scott complexity of countable structures and a survey of recent results
Bulletin of Symbolic Logic, 28 (2022), no. 1, 71–103. [ pdf | DOI ]
-
Relationships between computability-theoretic properties of problems (with Rod Downey, Noam Greenberg, Ludovic Patey, and Dan Turetsky)
Journal of Symbolic Logic, 87 (2022), no. 1, 47–71. [ pdf | DOI ]
-
The tree of tuples of a structure (with Antonio Montalbán)
Journal of Symbolic Logic, 87 (2022), no. 1, 21–46. [ pdf | DOI ]
-
Scott complexity of countable structures (with Rachael Alvir, Noam Greenberg, and Dan Turetsky)
Journal of Symbolic Logic, 86 (2021), no. 4, 1706–1720. [ pdf | DOI ]
-
Some questions of uniformity in algorithmic randomness (with Laurent Bienvenu and Barbara Csima)
Journal of Symbolic Logic, 86 (2021), no. 4, 1612–1631. [ pdf ]
-
Computing sets from all infinite subsets (with Noam Greenberg, Ludovic Patey, and Dan Turetsky)
Transactions of the AMS, 374 (2021), 8131–8160. [ pdf | DOI ]
-
Non-density in punctual computability (with Noam Greenberg, Alexander Melnikov, and Dan Turetsky)
Annals of Pure and Applied Logic, 172 (2021), no. 9, 102985, 17 pp. [ pdf | DOI ]
-
Relativizing computable categoricity (with Rod Downey and Alexander Melnikov)
Proceedings of the AMS, 149 (2021), no. 9, 3999–4013. [ pdf | DOI ]
-
The property “arithmetic-is-recursive” on a cone (with Uri Andrews and Noah Schweber)
Journal of Mathematical Logic, 21 (2021), no. 3, 2150021. [ pdf | DOI ]
-
Computability up to homeomorphism (with Alexander Melnikov and Keng Meng Ng)
Journal of Symbolic Logic, 85 (2020), no. 4, 1664–1686. [ pdf | DOI ]
-
Finitely generated groups are universal among finitely generated structures (with Meng-Che "Turbo" Ho)
Annals of Pure and Applied Logic, 172 (2021), no. 1, 102855, 21 pp. [ pdf | DOI ]
-
The logic of comparative cardinality (with Yifeng Ding and Wesley Holliday)
Journal of Symbolic Logic, 85 (2020), no. 3, 972–1005. [ pdf | DOI ]
-
Graphs are not universal for online computability (with Rod Downey, Iskander Kalimullin, Alexander Melnikov, and Daniel Turetsky)
Journal of Computing and Systems Sciences, 112 (2020), 1–12. [ pdf | DOI ]
-
Degrees of categoricity above limit ordinals (with Barbara Csima, Michael Deveau, and Mohammad Assem Mahmoud)
Computability, 9 (2020), no. 2, 127–137. [ pdf | DOI ]
-
Optimal bounds for single-source Kolmogorov extractors (with Laurent Bienvenu and Barbara Csima)
Transactions of the AMS, 373 (2020), no. 3, 1983–2006. [ pdf | DOI ]
-
First-order possibility models and finitary completeness proofs
Review of Symbolic Logic, 12 (2019), no. 4, 637–662. [ pdf | DOI ]
-
Automatic and polynomial-time algebraic structures (with Nikolay Bazhenov, Iskander Kalimullin, Alexander Melnikov, and Keng Meng Ng)
Journal of Symbolic Logic, 84 (2019), no. 4, 1630–1669. [ pdf | DOI ]
-
Constructing decidable graphs from decidable structures (with Nikolay Bazhenov)
Algebra and Logic, 58 (2019), no. 5, 369–382. [ pdf | DOI ]
-
Characterizations of cancellable groups (with Meng-che Ho)
Proceedings of the AMS, 147 (2019), no. 8, 3533–3545. [ pdf | DOI ]
-
Effective aspects of algorithmically random structures (with Bakh Khoussainov and Daniel Turetsky)
Computability, 8 (2019), no. 3-4, 359–375. [ pdf | DOI ]
-
A first-order theory of Ulm type
Computability, 8 (2019), no. 3-4, 347–358. [ pdf | DOI ]
-
There is no classification of the decidably presentable structures
Journal of Mathematical Logic, 18 (2018), no. 2. [ pdf | DOI ]
-
Borel functors and infinitary interpretations (with Russell Miller and Antonio Montalbán).
Journal of Symbolic Logic, 83 (2018), no. 4, 1434–1456. [ pdf | DOI ]
-
On optimal Scott sentences of finitely generated algebraic structures (with Meng-Che "Turbo" Ho)
Proceedings of the AMS, 146 (2018), no. 10, 4473–4485. [ pdf | DOI ]
-
Degree spectra of relations on a cone
Memoirs of the AMS, 253 (2018), no. 1208. [ pdf | DOI ]
-
Computable valued fields
Archive for Mathematical Logic, 57 (2018), no. 5–6, 473–495. [ pdf | DOI ]
-
Some new computable structures of high rank (with Gregory Igusa and Julia Knight).
Proceedings of the AMS, 146 (2018), no. 7, 3097–3109. [ pdf | DOI ]
-
Scott ranks of models of a theory
Advances in Mathematics, 330 (2018), 109–147. [ pdf | DOI ]
-
Left-orderable computable groups
Journal of Symbolic Logic, 83 (2018), no. 1, 237–255. [ pdf | DOI ]
-
Inferring probability comparisons (with Wesley Holliday and Thomas Icard)
Mathematic Social Science, 91 (2018), 62–70. [ pdf | DOI ]
-
On computable field embeddings and difference closed fields (with Alexander Melnikov and Russell Miller).
Canadian Journal of Mathematics, 69 (2017), no. 6, 1338–1363. [ pdf | DOI ]
-
The Gamma question for many-one degrees
Annals of Pure and Applied Logic, 168 (2017), no. 7, 1396–1405. [ pdf | DOI ]
-
Preferential structures for comparative probabilistic reasoning (with Wesley Holliday and Thomas Icard).
AAAI, (2017), 1135–1141. [ pdf | DOI ]
-
Computable functors and effective interpretability (with Alexander Melnikov, Russell Miller, and Antonio Montalbán).
Journal of Symbolic Logic, 82 (2017), no. 1, 77–97. [ pdf | DOI ]
-
Degrees of categoricity on a cone via \(\eta\)-systems (with Barbara Csima)
Journal of Symbolic Logic, 82 (2017), no. 1, 325–346. [ pdf | DOI ]
-
A note on cancellation axioms for comparative probability (with Wesley Holliday and Thomas Icard)
Theory and Decision, 80 (2016), no. 1, 159–166. [ pdf | DOI ]
-
Independence in computable algebra (with Alexander Melnikov and Antonio Montalbán).
Journal of Algebra, 443 (2015), 441–468. [ pdf | DOI ]
-
Differential-algebraic jet spaces preserve internality to the constants (with Zoé Chatzidakis and Rahim Moosa).
Journal of Symbolic Logic, 80 (2015), no. 3, 1022–1034. [ pdf | DOI ]
-
Nonstandard methods for bounds in differential polynomial rings (with Rahim Moosa and Jack Klys).
Journal of Algebra, 360 (2012), 71–86. [ pdf | DOI ]
