Publication | Date of Publication | Type |
---|
Generically Computable abelian groups | 2024-01-12 | Paper |
Extraction rates of random continuous functionals | 2024-01-12 | Paper |
Feasibly categorical models | 2023-12-12 | Paper |
Randomness extraction in computability theory | 2023-03-09 | Paper |
Generically and coarsely computable isomorphisms | 2023-01-12 | Paper |
Complexity of injection structures induced by finite state transducers | 2023-01-04 | Paper |
Densely computable structures | 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 | 2021-06-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q5150976 | 2021-02-16 | Paper |
Effective categoricity of automatic equivalence and nested equivalence structures | 2020-08-26 | Paper |
On the complexity of index sets for finite predicate logic programs which allow function symbols | 2020-04-29 | Paper |
Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic | 2020-04-02 | Paper |
The random members of a \({\Pi }_{1}^{0}\) class | 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 | 2018-01-18 | Paper |
The Probability of a Computable Output from a Random Oracle | 2017-10-16 | Paper |
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols | 2017-07-21 | Paper |
Random numbers as probabilities of machine behavior | 2017-05-02 | Paper |
Injection Structures Specified by Finite State Transducers | 2017-04-04 | Paper |
Sub-computable Bounded Pseudorandomness | 2015-12-11 | Paper |
Algorithmically Random Functions and Effective Capacities | 2015-09-30 | Paper |
Computability-theoretic properties of injection structures | 2015-05-11 | Paper |
Computability and Categoricity of Ultrahomogeneous Structures | 2015-02-25 | Paper |
Sub-computable Boundedness Randomness | 2015-01-15 | Paper |
Two-to-one structures | 2014-04-01 | Paper |
Medvedev Degrees of Generalized R.E. separating Classes | 2013-05-10 | Paper |
Random Continuous Functions | 2013-05-10 | Paper |
Effective Symbolic Dynamics | 2013-05-03 | Paper |
Effective randomness of unions and intersections | 2013-04-15 | Paper |
A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs | 2012-12-28 | Paper |
Computability of countable subshifts in one dimension | 2012-12-07 | Paper |
Algorithmic Randomness and Capacity of Closed Sets | 2012-04-02 | Paper |
\(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures | 2011-09-22 | Paper |
Effective Categoricity of Injection Structures | 2011-09-09 | Paper |
A superhigh diamond in the c.e. tt-degrees | 2011-03-02 | Paper |
Immunity and non-cupping for closed sets | 2010-09-07 | Paper |
Computability of Countable Subshifts | 2010-07-29 | Paper |
$\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures | 2010-07-28 | Paper |
Immunity for Closed Sets | 2010-07-28 | Paper |
Effective categoricity of abelian \(p\)-groups | 2009-06-10 | Paper |
Equivalence structures and isomorphisms in the difference hierarchy | 2009-06-04 | Paper |
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms | 2009-06-03 | Paper |
Linear orders with distinguished function symbol | 2009-03-17 | Paper |
Space complexity of abelian groups | 2009-03-17 | Paper |
K-Triviality of Closed Sets and Continuous Functions | 2009-03-02 | Paper |
Pseudojumps and Formula Classes | 2009-03-02 | Paper |
Computable symbolic dynamics | 2008-10-08 | Paper |
Degrees of difficulty of generalized r.e. separating classes | 2008-05-26 | Paper |
Algorithmic randomness of continuous functions | 2008-05-26 | Paper |
Effectively closed sets and enumerations | 2008-05-26 | Paper |
Algorithmic Randomness of Closed Sets | 2008-02-07 | Paper |
Pseudojump Operators and $\Pi^0_1$ Classes | 2007-11-13 | Paper |
K-Trivial Closed Sets and Continuous Functions | 2007-11-13 | Paper |
Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
On the complexity of inductive definitions | 2007-02-09 | Paper |
Effective categoricity of equivalence structures | 2006-08-16 | Paper |
Complexity, decidability and completeness | 2006-08-03 | Paper |
Logic programming with infinite sets | 2006-01-23 | Paper |
New Computational Paradigms | 2006-01-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q5711878 | 2005-12-08 | Paper |
Minimal extensions of ?01 classes | 2005-04-07 | Paper |
Index sets for computable differential equations | 2005-02-16 | Paper |
Locally determined logic programs and recursive stable models | 2004-05-27 | Paper |
Global properties of the lattice of $\Pi ^0_1$ classes | 2003-09-28 | Paper |
Density of the Medvedev lattice of \(\Pi^0_1\) classes | 2003-09-16 | Paper |
Index sets for ω‐languages | 2003-03-19 | Paper |
Effectively closed sets and graphs of computable real functions. | 2002-07-31 | Paper |
Initial segments of the lattice of Π10 classes | 2002-07-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4513963 | 2001-03-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4946095 | 2000-11-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4249365 | 2000-07-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4934277 | 2000-06-29 | Paper |
Feasible graphs with standard universe | 2000-06-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4955327 | 2000-05-25 | Paper |
Index sets for \(\Pi^0_1\) classes | 1999-11-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4249723 | 1999-09-15 | Paper |
Index sets in computable analysis | 1999-06-21 | Paper |
Complexity and categoricity | 1998-05-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4850547 | 1996-09-22 | Paper |
Feasible Graphs and Colorings | 1995-12-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4764101 | 1995-10-31 | Paper |
Countable thin \(\Pi^0_1\) classes | 1993-05-16 | Paper |
Recursively presented games and strategies | 1992-12-16 | Paper |
Polynomial-time Abelian groups | 1992-09-27 | Paper |
Polynomial-time versus recursive models | 1992-06-28 | Paper |
On the ranked points of a Π10 set | 1989-01-01 | Paper |
Members of countable \(\Pi ^ 0_ 1\) classes | 1986-01-01 | Paper |
The stability problem: New results and counterexamples | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3684114 | 1984-01-01 | Paper |
Monotone reducibility and the family of infinite sets | 1984-01-01 | Paper |
On the Borel class of the derived set operator. II | 1983-01-01 | Paper |
Representations of Well-Founded Preference Orders | 1983-01-01 | Paper |
On the Borel class of the derived set operator | 1982-01-01 | Paper |
Inductive definability: Measure and category | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3868453 | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3902525 | 1980-01-01 | Paper |
The stability problem for transformations of the circle | 1979-01-01 | Paper |
On vertex k-partitions of certain infinite graphs | 1978-01-01 | Paper |
Parametric inductive definitions and recursive operators over the continuum | 1978-01-01 | Paper |
Measurable Parametrizations and Selections | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4145698 | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4110993 | 1976-01-01 | Paper |
Monotone inductive definitions over the continuum | 1976-01-01 | Paper |
Cores of Π11 sets of reals | 1975-01-01 | Paper |
Analytic inductive definitions | 1974-01-01 | Paper |
The boundedness principle in ordinal recursion | 1974-01-01 | Paper |
Inductively defined sets of reals | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4770391 | 1974-01-01 | Paper |