| Publication | Date of Publication | Type |
|---|
| Comparing dialectical systems: contradiction and counterexample in belief change | 2025-12-15 | Paper |
| SCC-recursiveness in infinite argumentation | 2025-12-15 | Paper |
Complexity profiles and generic Muchnik reducibility Advances in Mathematics | 2023-12-21 | Paper |
Limit computability and ultrafilters Computability | 2023-09-13 | Paper |
ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS Journal of Symbolic Logic | 2023-09-11 | Paper |
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER Journal of Symbolic Logic | 2023-09-11 | Paper |
Initial segments of the degrees of ceers Journal of Symbolic Logic | 2022-08-29 | Paper |
Computability and the symmetric difference operator Logic Journal of the IGPL | 2022-07-22 | Paper |
| Investigating the computable Friedman-Stanley jump | 2022-06-23 | Paper |
The first-order theory of the computably enumerable equivalence relations in the uncountable setting Journal Of Logic And Computation | 2022-02-08 | Paper |
EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS The Review of Symbolic Logic | 2022-02-07 | Paper |
IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE Journal of Symbolic Logic | 2022-01-17 | Paper |
Recursive spectra of flat strongly minimal theories Proceedings of the American Mathematical Society | 2021-11-09 | Paper |
The property ``arithmetic-is-recursive on a cone Journal of Mathematical Logic | 2021-11-03 | Paper |
Self-full ceers and the uniform join operator Journal Of Logic And Computation | 2021-10-21 | Paper |
Building models of strongly minimal theories Advances in Mathematics | 2021-07-05 | Paper |
Scattered sentences have few separable randomizations Archive for Mathematical Logic | 2020-07-17 | Paper |
The theory of ceers computes true arithmetic Annals of Pure and Applied Logic | 2020-06-02 | Paper |
On isomorphism classes of computably enumerable equivalence relations Journal of Symbolic Logic | 2020-04-17 | Paper |
Joins and meets in the structure of ceers Computability | 2020-01-17 | Paper |
Characterizing the continuous degrees Israel Journal of Mathematics | 2019-12-17 | Paper |
$[0,n\cup \{\omega\}$ is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature] (available as arXiv preprint) | 2019-08-25 | Paper |
Independence in randomizations Journal of Mathematical Logic | 2019-07-08 | Paper |
On cototality and the skip operator in the enumeration degrees Transactions of the American Mathematical Society | 2019-07-03 | Paper |
Trial and error mathematics: Dialectical systems and completions of theories Journal Of Logic And Computation | 2019-03-01 | Paper |
Trial and error mathematics: Dialectical systems and completions of theories Journal Of Logic And Computation | 2019-03-01 | Paper |
Effective inseparability, lattices, and pre-ordering relations (available as arXiv preprint) | 2019-01-18 | Paper |
Definable sets containing productsets in expansions of groups Journal of Group Theory | 2019-01-09 | Paper |
Hindman's theorem and idempotent types Semigroup Forum | 2018-12-21 | Paper |
Strongly minimal theories with recursive models Journal of the European Mathematical Society (JEMS) | 2018-06-21 | Paper |
Jumps of computably enumerable equivalence relations Annals of Pure and Applied Logic | 2018-01-11 | Paper |
Theory spectra and classes of theories Transactions of the American Mathematical Society | 2017-06-14 | Paper |
THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES Journal of Symbolic Logic | 2017-04-28 | Paper |
The complexity of index sets of classes of computably enumerable equivalence relations Journal of Symbolic Logic | 2017-04-28 | Paper |
A survey on universal computably enumerable equivalence relations Computability and Complexity | 2017-04-04 | Paper |
Nondensity of Double Bubbles in the D.C.E. Degrees Computability and Complexity | 2017-04-04 | Paper |
| Algebraic Independence Relations in Randomizations | 2017-03-31 | Paper |
Asymptotic density, computable traceability, and 1-randomness Fundamenta Mathematicae | 2016-07-08 | Paper |
Comparing classes of finite sums Algebra and Logic | 2016-05-12 | Paper |
Separable models of randomizations The Journal of Symbolic Logic | 2016-03-22 | Paper |
A local characterization of VC-minimality Proceedings of the American Mathematical Society | 2016-03-08 | Paper |
On the structure of the degrees of relative provability Israel Journal of Mathematics | 2015-06-26 | Paper |
Spectra of theories and structures Proceedings of the American Mathematical Society | 2015-02-02 | Paper |
Definable closure in randomizations Annals of Pure and Applied Logic | 2015-01-23 | Paper |
Decidable models of \(\omega\)-stable theories The Journal of Symbolic Logic | 2014-09-30 | Paper |
Universal computably enumerable equivalence relations The Journal of Symbolic Logic | 2014-09-30 | Paper |
| Independence relations in randomizations | 2014-09-04 | Paper |
Spectra of atomic theories Journal of Symbolic Logic | 2014-04-04 | Paper |
Spectra of atomic theories Journal of Symbolic Logic | 2014-04-04 | Paper |
Recursive spectra of strongly minimal theories satisfying the Zilber trichotomy Transactions of the American Mathematical Society | 2014-03-12 | Paper |
The degrees of bi-hyperhyperimmune sets Annals of Pure and Applied Logic | 2013-12-16 | Paper |
The index set of uncountably categorical theories Israel Journal of Mathematics | 2013-11-01 | Paper |
The degrees of categorical theories with recursive models Proceedings of the American Mathematical Society | 2013-07-05 | Paper |
A new spectrum of recursive models using an amalgamation construction Journal of Symbolic Logic | 2011-10-10 | Paper |
New spectra of strongly minimal theories in finite languages Annals of Pure and Applied Logic | 2011-09-12 | Paper |
Algorithmically finite, universal, and $*$-universal groups (available as arXiv preprint) | N/A | Paper |
The Borel complexity of the class of models of first-order theories (available as arXiv preprint) | N/A | Paper |
A jump operator on the Weihrauch degrees (available as arXiv preprint) | N/A | Paper |
Two results on complexities of decision problems of groups (available as arXiv preprint) | N/A | Paper |