| Publication | Date of Publication | Type |
|---|
Iterated priority arguments in descriptive set theory
The Bulletin of Symbolic Logic | 2024-11-12 | Paper |
An arithmetic analysis of closed surfaces
Transactions of the American Mathematical Society | 2024-07-04 | Paper |
Enumerations of families closed under finite differences
Computability | 2024-04-15 | Paper |
Computable Stone spaces
Annals of Pure and Applied Logic | 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?
The Bulletin of Symbolic Logic | 2023-03-20 | Paper |
A MINIMAL SET LOW FOR SPEED
Journal of Symbolic Logic | 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
Mathematical Social Sciences | 2022-04-21 | Paper |
The tree of tuples of a structure
Journal of Symbolic Logic | 2022-04-12 | Paper |
Relationships between computability-theoretic properties of problems
Journal of Symbolic Logic | 2022-04-12 | Paper |
An introduction to the Scott complexity of countable structures and a survey of recent results
The Bulletin of Symbolic Logic | 2022-04-04 | Paper |
SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
Journal of Symbolic Logic | 2022-01-17 | Paper |
SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS
Journal of Symbolic Logic | 2022-01-17 | Paper |
The property ``arithmetic-is-recursive on a cone
Journal of Mathematical Logic | 2021-11-03 | Paper |
Some Questions of Uniformity in Algorithmic Randomness
| 2021-11-02 | Paper |
Computing sets from all infinite subsets
Transactions of the American Mathematical Society | 2021-10-21 | Paper |
Relativizing computable categoricity
Proceedings of the American Mathematical Society | 2021-07-28 | Paper |
Non-density in punctual computability
Annals of Pure and Applied Logic | 2021-07-26 | Paper |
Computability of Polish spaces up to homeomorphism
Journal of Symbolic Logic | 2021-04-15 | Paper |
Preferential Structures for Comparative Probabilistic Reasoning
| 2021-04-06 | Paper |
The logic of comparative cardinality
Journal of Symbolic Logic | 2021-03-19 | Paper |
A minimal set low for speed
| 2020-11-18 | Paper |
Degrees of categoricity above limit ordinals
Computability | 2020-11-09 | Paper |
Finitely generated groups are universal among finitely generated structures
Annals of Pure and Applied Logic | 2020-10-13 | Paper |
Graphs are not universal for online computability
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Constructing decidable graphs from decidable structures
Algebra and Logic | 2020-02-28 | Paper |
Optimal bounds for single-source Kolmogorov extractors
Transactions of the American Mathematical Society | 2020-02-26 | Paper |
FIRST-ORDER POSSIBILITY MODELS AND FINITARY COMPLETENESS PROOFS
The Review of Symbolic Logic | 2020-02-20 | Paper |
A first-order theory of Ulm type
Computability | 2020-01-17 | Paper |
Effective aspects of algorithmically random structures
Computability | 2020-01-17 | Paper |
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Journal of Symbolic Logic | 2020-01-10 | Paper |
Characterizations of cancellable groups
Proceedings of the American Mathematical Society | 2019-07-17 | Paper |
Relationships between computability-theoretic properties of problems
| 2019-03-11 | Paper |
Degree spectra of relations on a cone
Memoirs of the American Mathematical Society | 2019-01-11 | Paper |
BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
Journal of Symbolic Logic | 2019-01-04 | Paper |
There is no classification of the decidably presentable structures
Journal of Mathematical Logic | 2018-12-20 | Paper |
Characterizations of Cancellable Groups
| 2018-09-19 | Paper |
Computable valued fields
Archive for Mathematical Logic | 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
Proceedings of the American Mathematical Society | 2018-08-02 | Paper |
Inferring probability comparisons
Mathematical Social Sciences | 2018-07-03 | Paper |
Scott ranks of models of a theory
Advances in Mathematics | 2018-06-22 | Paper |
Left-orderable computable groups
Journal of Symbolic Logic | 2018-05-02 | Paper |
Some new computable structures of high rank
Proceedings of the American Mathematical Society | 2018-04-20 | Paper |
On computable field embeddings and difference closed fields
Canadian Journal of Mathematics | 2017-12-13 | Paper |
Scott Ranks of Classifications of the Admissibility Equivalence Relation
| 2017-12-03 | Paper |
Degrees of categoricity on a cone via \(\eta\)-systems
Journal of Symbolic Logic | 2017-06-01 | Paper |
Computable functors and effective interpretability
Journal of Symbolic Logic | 2017-06-01 | Paper |
The gamma question for many-one degrees
Annals of Pure and Applied Logic | 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
Theory and Decision | 2016-03-10 | Paper |
Differential-algebraic jet spaces preserve internality to the constants
Journal of Symbolic Logic | 2015-11-09 | Paper |
Independence in computable algebra
Journal of Algebra | 2015-09-25 | Paper |
Nonstandard methods for bounds in differential polynomial rings
Journal of Algebra | 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 |
