| Publication | Date of Publication | Type |
|---|
Speech acts in mathematics Synthese | 2023-12-14 | Paper |
Word problems and ceers Mathematical Logic Quarterly | 2023-09-11 | Paper |
ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS Journal of Symbolic Logic | 2023-09-11 | Paper |
Classifying word problems of finitely generated algebras via computable reducibility International Journal of Algebra and Computation | 2023-07-18 | Paper |
Learning algebraic structures with the help of Borel equivalence relations Theoretical Computer Science | 2023-03-10 | Paper |
Primitive recursive equivalence relations and their primitive recursive complexity Computability | 2023-01-12 | Paper |
Calculating the mind change complexity of learning algebraic structures | 2022-12-07 | Paper |
Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy | 2022-06-24 | Paper |
Investigating the computable Friedman-Stanley jump | 2022-06-23 | Paper |
On the Turing complexity of learning finite families of algebraic structures Journal Of Logic And Computation | 2021-11-09 | Paper |
Learning algebraic structures with the help of Borel equivalence relations | 2021-10-27 | Paper |
Punctual equivalence relations and their (punctual) complexity | 2021-09-09 | Paper |
Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy | 2021-07-21 | Paper |
Degrees of bi-embeddable categoricity Computability | 2021-06-25 | Paper |
A note on the category of equivalence relations | 2021-05-20 | Paper |
Learning families of algebraic structures from informant Information and Computation | 2020-12-15 | Paper |
Minimal equivalence relations in hyperarithmetical and analytical hierarchies Lobachevskii Journal of Mathematics | 2020-10-27 | Paper |
Classifying equivalence relations in the Ershov hierarchy Archive for Mathematical Logic | 2020-10-15 | Paper |
Bi‐embeddability spectra and bases of spectra Mathematical Logic Quarterly | 2020-05-06 | Paper |
Naturalness in mathematics Boston Studies in the Philosophy and History of Science | 2020-02-04 | Paper |
Comparing the isomorphism types of equivalence structures and preorders | 2020-01-22 | Paper |
Measuring the complexity of reductions between equivalence relations Computability | 2020-01-17 | Paper |
Degrees of bi-embeddable categoricity of equivalence structures Archive for Mathematical Logic | 2019-07-04 | Paper |
Computable bi-embeddable categoricity Algebra and Logic | 2019-03-13 | Paper |
Trial and error mathematics: Dialectical systems and completions of theories Journal Of Logic And Computation | 2019-03-01 | Paper |
Limit Learning Equivalence Structures | 2019-02-21 | Paper |
Bi-embeddability spectra and bases of spectra | 2018-08-16 | Paper |
TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS The Review of Symbolic Logic | 2017-05-31 | Paper |
Trial and error mathematics. I: Dialectical and quasidialectical systems The Review of Symbolic Logic | 2016-07-29 | Paper |
Universal computably enumerable equivalence relations The Journal of Symbolic Logic | 2014-09-30 | Paper |