| Publication | Date of Publication | Type |
|---|
Generically Computable abelian groups
Unconventional Computation and Natural Computation | 2024-01-12 | Paper |
Extraction rates of random continuous functionals
Unconventional Computation and Natural Computation | 2024-01-12 | Paper |
Feasibly categorical models
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Randomness extraction in computability theory
Computability | 2023-03-09 | Paper |
Generically and coarsely computable isomorphisms
Computability | 2023-01-12 | Paper |
Complexity of injection structures induced by finite state transducers
Journal Of Logic And Computation | 2023-01-04 | Paper |
Densely computable structures
Journal Of Logic And Computation | 2022-09-08 | Paper |
The isomorphism problem for FST injection structures
| 2022-07-01 | Paper |
Complexity and categoricity of injection structures induced by finite state transducers
| 2022-03-22 | Paper |
Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic
| 2021-10-10 | Paper |
Logic Programming and Effectively Closed Sets
Structure and Randomness in Computability and Set Theory | 2021-06-15 | Paper |
scientific article; zbMATH DE number 7311154 (Why is no real title available?)
| 2021-02-16 | Paper |
Effective categoricity of automatic equivalence and nested equivalence structures
Theory of Computing Systems | 2020-08-26 | Paper |
On the complexity of index sets for finite predicate logic programs which allow function symbols
Journal Of Logic And Computation | 2020-04-29 | Paper |
Set theory and foundations of mathematics. An introduction to mathematical logic. Volume I. Set theory
| 2020-04-02 | Paper |
The random members of a \({\Pi }_{1}^{0}\) class
Theory of Computing Systems | 2018-10-05 | Paper |
Online computability and differentiation in the Cantor space
| 2018-09-06 | Paper |
Generically Computable Equivalence Structures and Isomorphisms
| 2018-08-08 | Paper |
Computability and categoricity of weakly ultrahomogeneous structures
Computability | 2018-01-18 | Paper |
The probability of a computable output from a random oracle
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
Index sets for finite normal predicate logic programs with function symbols
Logical Foundations of Computer Science | 2017-07-21 | Paper |
Random numbers as probabilities of machine behavior
Theoretical Computer Science | 2017-05-02 | Paper |
Injection Structures Specified by Finite State Transducers
Computability and Complexity | 2017-04-04 | Paper |
Sub-computable bounded pseudorandomness
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Algorithmically Random Functions and Effective Capacities
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Computability-theoretic properties of injection structures
Algebra and Logic | 2015-05-11 | Paper |
Computability and categoricity of ultrahomogeneous structures
Language, Life, Limits | 2015-02-25 | Paper |
Sub-computable Boundedness Randomness
Logical Methods in Computer Science | 2015-01-15 | Paper |
Two-to-one structures
Journal Of Logic And Computation | 2014-04-01 | Paper |
Medvedev degrees of generalized r.e. separating classes
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Random Continuous Functions
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Effective symbolic dynamics
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Effective randomness of unions and intersections
Theory of Computing Systems | 2013-04-15 | Paper |
A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
Annals of Mathematics and Artificial Intelligence | 2012-12-28 | Paper |
Computability of countable subshifts in one dimension
Theory of Computing Systems | 2012-12-07 | Paper |
Algorithmic randomness and capacity of closed sets
Logical Methods in Computer Science | 2012-04-02 | Paper |
\(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
Effective Categoricity of Injection Structures
Models of Computation in Context | 2011-09-09 | Paper |
A superhigh diamond in the c.e. tt-degrees
Archive for Mathematical Logic | 2011-03-02 | Paper |
Immunity and non-cupping for closed sets
Tbilisi Mathematical Journal | 2010-09-07 | Paper |
Computability of countable subshifts
Programs, Proofs, Processes | 2010-07-29 | Paper |
\({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Immunity for closed sets
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Effective categoricity of abelian \(p\)-groups
Annals of Pure and Applied Logic | 2009-06-10 | Paper |
Equivalence structures and isomorphisms in the difference hierarchy
Journal of Symbolic Logic | 2009-06-04 | Paper |
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Space complexity of abelian groups
Archive for Mathematical Logic | 2009-03-17 | Paper |
Linear orders with distinguished function symbol
Archive for Mathematical Logic | 2009-03-17 | Paper |
K-Triviality of Closed Sets and Continuous Functions
Journal Of Logic And Computation | 2009-03-02 | Paper |
Pseudojumps and Formula Classes
Journal Of Logic And Computation | 2009-03-02 | Paper |
Computable symbolic dynamics
Mathematical Logic Quarterly | 2008-10-08 | Paper |
Effectively closed sets and enumerations
Archive for Mathematical Logic | 2008-05-26 | Paper |
Algorithmic randomness of continuous functions
Archive for Mathematical Logic | 2008-05-26 | Paper |
Degrees of difficulty of generalized r.e. separating classes
Archive for Mathematical Logic | 2008-05-26 | Paper |
Algorithmic Randomness of Closed Sets
Journal Of Logic And Computation | 2008-02-07 | Paper |
K-Trivial Closed Sets and Continuous Functions
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Pseudojump Operators and $\Pi^0_1$ Classes
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
On the complexity of inductive definitions
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
Effective categoricity of equivalence structures
Annals of Pure and Applied Logic | 2006-08-16 | Paper |
Complexity, decidability and completeness
Journal of Symbolic Logic | 2006-08-03 | Paper |
Logic programming with infinite sets
Annals of Mathematics and Artificial Intelligence | 2006-01-23 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
scientific article; zbMATH DE number 2236627 (Why is no real title available?)
| 2005-12-08 | Paper |
Minimal extensions of ?01 classes
MLQ | 2005-04-07 | Paper |
Index sets for computable differential equations
Mathematical Logic Quarterly | 2005-02-16 | Paper |
Locally determined logic programs and recursive stable models
Annals of Mathematics and Artificial Intelligence | 2004-05-27 | Paper |
Global properties of the lattice of $\Pi ^0_1$ classes
Proceedings of the American Mathematical Society | 2003-09-28 | Paper |
Density of the Medvedev lattice of \(\Pi^0_1\) classes
Archive for Mathematical Logic | 2003-09-16 | Paper |
Index sets for ω‐languages
Mathematical Logic Quarterly | 2003-03-19 | Paper |
Effectively closed sets and graphs of computable real functions.
Theoretical Computer Science | 2002-07-31 | Paper |
Initial segments of the lattice of Π10 classes
Journal of Symbolic Logic | 2002-07-22 | Paper |
scientific article; zbMATH DE number 1531920 (Why is no real title available?)
| 2001-03-11 | Paper |
scientific article; zbMATH DE number 1421070 (Why is no real title available?)
| 2000-11-14 | Paper |
scientific article; zbMATH DE number 1302879 (Why is no real title available?)
| 2000-07-27 | Paper |
scientific article; zbMATH DE number 1390012 (Why is no real title available?)
| 2000-06-29 | Paper |
Feasible graphs with standard universe
Annals of Pure and Applied Logic | 2000-06-14 | Paper |
scientific article; zbMATH DE number 1453054 (Why is no real title available?)
| 2000-05-25 | Paper |
Index sets for \(\Pi^0_1\) classes
Annals of Pure and Applied Logic | 1999-11-23 | Paper |
scientific article; zbMATH DE number 1303200 (Why is no real title available?)
| 1999-09-15 | Paper |
Index sets in computable analysis
Theoretical Computer Science | 1999-06-21 | Paper |
Complexity and categoricity
Information and Computation | 1998-05-04 | Paper |
scientific article; zbMATH DE number 806746 (Why is no real title available?)
| 1996-09-22 | Paper |
Feasible Graphs and Colorings
Mathematical Logic Quarterly | 1995-12-13 | Paper |
scientific article; zbMATH DE number 749920 (Why is no real title available?)
| 1995-10-31 | Paper |
Countable thin \(\Pi^0_1\) classes
Annals of Pure and Applied Logic | 1993-05-16 | Paper |
Recursively presented games and strategies
Mathematical Social Sciences | 1992-12-16 | Paper |
Polynomial-time Abelian groups
Annals of Pure and Applied Logic | 1992-09-27 | Paper |
Polynomial-time versus recursive models
Annals of Pure and Applied Logic | 1992-06-28 | Paper |
On the ranked points of a Π10 set
Journal of Symbolic Logic | 1989-01-01 | Paper |
Members of countable \(\Pi ^ 0_ 1\) classes
Annals of Pure and Applied Logic | 1986-01-01 | Paper |
The stability problem: New results and counterexamples
Letters in Mathematical Physics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3906488 (Why is no real title available?)
| 1984-01-01 | Paper |
Monotone reducibility and the family of infinite sets
Journal of Symbolic Logic | 1984-01-01 | Paper |
On the Borel class of the derived set operator. II
Bulletin de la Société mathématique de France | 1983-01-01 | Paper |
Representations of Well-Founded Preference Orders
Canadian Journal of Mathematics | 1983-01-01 | Paper |
On the Borel class of the derived set operator
Bulletin de la Société mathématique de France | 1982-01-01 | Paper |
Inductive definability: Measure and category
Advances in Mathematics | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3671320 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3711424 (Why is no real title available?)
| 1980-01-01 | Paper |
The stability problem for transformations of the circle
Proceedings of the Royal Society of Edinburgh: Section A Mathematics | 1979-01-01 | Paper |
Parametric inductive definitions and recursive operators over the continuum
Fundamenta Mathematicae | 1978-01-01 | Paper |
Measurable Parametrizations and Selections
| 1978-01-01 | Paper |
On vertex k-partitions of certain infinite graphs
Discrete Mathematics | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3573851 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3534480 (Why is no real title available?)
| 1976-01-01 | Paper |
Monotone inductive definitions over the continuum
Journal of Symbolic Logic | 1976-01-01 | Paper |
Cores of Π11 sets of reals
Journal of Symbolic Logic | 1975-01-01 | Paper |
The boundedness principle in ordinal recursion
Fundamenta Mathematicae | 1974-01-01 | Paper |
Inductively defined sets of reals
Bulletin of the American Mathematical Society | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3445235 (Why is no real title available?)
| 1974-01-01 | Paper |
Analytic inductive definitions
Journal of Symbolic Logic | 1974-01-01 | Paper |
Generically Computable Linear Orderings
| N/A | Paper |
