Douglas Cenzer

From MaRDI portal
Person:524277

Available identifiers

zbMath Open cenzer.douglasMaRDI QIDQ524277

List of research outcomes

PublicationDate of PublicationType
Generically Computable abelian groups2024-01-12Paper
Extraction rates of random continuous functionals2024-01-12Paper
Feasibly categorical models2023-12-12Paper
Randomness extraction in computability theory2023-03-09Paper
Generically and coarsely computable isomorphisms2023-01-12Paper
Complexity of injection structures induced by finite state transducers2023-01-04Paper
Densely computable structures2022-09-08Paper
The isomorphism problem for FST injection structures2022-07-01Paper
Complexity and categoricity of injection structures induced by finite state transducers2022-03-22Paper
Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic2021-10-10Paper
Logic Programming and Effectively Closed Sets2021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51509762021-02-16Paper
Effective categoricity of automatic equivalence and nested equivalence structures2020-08-26Paper
On the complexity of index sets for finite predicate logic programs which allow function symbols2020-04-29Paper
Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic2020-04-02Paper
The random members of a \({\Pi }_{1}^{0}\) class2018-10-05Paper
Online computability and differentiation in the Cantor space2018-09-06Paper
Generically Computable Equivalence Structures and Isomorphisms2018-08-08Paper
Computability and categoricity of weakly ultrahomogeneous structures2018-01-18Paper
The Probability of a Computable Output from a Random Oracle2017-10-16Paper
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols2017-07-21Paper
Random numbers as probabilities of machine behavior2017-05-02Paper
Injection Structures Specified by Finite State Transducers2017-04-04Paper
Sub-computable Bounded Pseudorandomness2015-12-11Paper
Algorithmically Random Functions and Effective Capacities2015-09-30Paper
Computability-theoretic properties of injection structures2015-05-11Paper
Computability and Categoricity of Ultrahomogeneous Structures2015-02-25Paper
Sub-computable Boundedness Randomness2015-01-15Paper
Two-to-one structures2014-04-01Paper
Medvedev Degrees of Generalized R.E. separating Classes2013-05-10Paper
Random Continuous Functions2013-05-10Paper
Effective Symbolic Dynamics2013-05-03Paper
Effective randomness of unions and intersections2013-04-15Paper
A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs2012-12-28Paper
Computability of countable subshifts in one dimension2012-12-07Paper
Algorithmic Randomness and Capacity of Closed Sets2012-04-02Paper
\(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures2011-09-22Paper
Effective Categoricity of Injection Structures2011-09-09Paper
A superhigh diamond in the c.e. tt-degrees2011-03-02Paper
Immunity and non-cupping for closed sets2010-09-07Paper
Computability of Countable Subshifts2010-07-29Paper
$\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures2010-07-28Paper
Immunity for Closed Sets2010-07-28Paper
Effective categoricity of abelian \(p\)-groups2009-06-10Paper
Equivalence structures and isomorphisms in the difference hierarchy2009-06-04Paper
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms2009-06-03Paper
Linear orders with distinguished function symbol2009-03-17Paper
Space complexity of abelian groups2009-03-17Paper
K-Triviality of Closed Sets and Continuous Functions2009-03-02Paper
Pseudojumps and Formula Classes2009-03-02Paper
Computable symbolic dynamics2008-10-08Paper
Degrees of difficulty of generalized r.e. separating classes2008-05-26Paper
Algorithmic randomness of continuous functions2008-05-26Paper
Effectively closed sets and enumerations2008-05-26Paper
Algorithmic Randomness of Closed Sets2008-02-07Paper
Pseudojump Operators and $\Pi^0_1$ Classes2007-11-13Paper
K-Trivial Closed Sets and Continuous Functions2007-11-13Paper
Logical Approaches to Computational Barriers2007-04-30Paper
Logical Approaches to Computational Barriers2007-04-30Paper
On the complexity of inductive definitions2007-02-09Paper
Effective categoricity of equivalence structures2006-08-16Paper
Complexity, decidability and completeness2006-08-03Paper
Logic programming with infinite sets2006-01-23Paper
New Computational Paradigms2006-01-11Paper
https://portal.mardi4nfdi.de/entity/Q57118782005-12-08Paper
Minimal extensions of ?01 classes2005-04-07Paper
Index sets for computable differential equations2005-02-16Paper
Locally determined logic programs and recursive stable models2004-05-27Paper
Global properties of the lattice of $\Pi ^0_1$ classes2003-09-28Paper
Density of the Medvedev lattice of \(\Pi^0_1\) classes2003-09-16Paper
Index sets for ω‐languages2003-03-19Paper
Effectively closed sets and graphs of computable real functions.2002-07-31Paper
Initial segments of the lattice of Π10 classes2002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q45139632001-03-11Paper
https://portal.mardi4nfdi.de/entity/Q49460952000-11-14Paper
https://portal.mardi4nfdi.de/entity/Q42493652000-07-27Paper
https://portal.mardi4nfdi.de/entity/Q49342772000-06-29Paper
Feasible graphs with standard universe2000-06-14Paper
https://portal.mardi4nfdi.de/entity/Q49553272000-05-25Paper
Index sets for \(\Pi^0_1\) classes1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42497231999-09-15Paper
Index sets in computable analysis1999-06-21Paper
Complexity and categoricity1998-05-04Paper
https://portal.mardi4nfdi.de/entity/Q48505471996-09-22Paper
Feasible Graphs and Colorings1995-12-13Paper
https://portal.mardi4nfdi.de/entity/Q47641011995-10-31Paper
Countable thin \(\Pi^0_1\) classes1993-05-16Paper
Recursively presented games and strategies1992-12-16Paper
Polynomial-time Abelian groups1992-09-27Paper
Polynomial-time versus recursive models1992-06-28Paper
On the ranked points of a Π10 set1989-01-01Paper
Members of countable \(\Pi ^ 0_ 1\) classes1986-01-01Paper
The stability problem: New results and counterexamples1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841141984-01-01Paper
Monotone reducibility and the family of infinite sets1984-01-01Paper
On the Borel class of the derived set operator. II1983-01-01Paper
Representations of Well-Founded Preference Orders1983-01-01Paper
On the Borel class of the derived set operator1982-01-01Paper
Inductive definability: Measure and category1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38684531980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39025251980-01-01Paper
The stability problem for transformations of the circle1979-01-01Paper
On vertex k-partitions of certain infinite graphs1978-01-01Paper
Parametric inductive definitions and recursive operators over the continuum1978-01-01Paper
Measurable Parametrizations and Selections1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41456981977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41109931976-01-01Paper
Monotone inductive definitions over the continuum1976-01-01Paper
Cores of Π11 sets of reals1975-01-01Paper
Analytic inductive definitions1974-01-01Paper
The boundedness principle in ordinal recursion1974-01-01Paper
Inductively defined sets of reals1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47703911974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Douglas Cenzer