Steffen Lempp

MaRDI QIDQ218972zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On cupping and Ahmad pairs Journal of Symbolic Logic	2024-11-25	Paper
Minimal covers in the Weihrauch degrees Proceedings of the American Mathematical Society	2024-10-18	Paper
Minimal covers in the Weihrauch degrees	2023-11-21	Paper
MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY Journal of Symbolic Logic	2023-09-11	Paper
Extensions of two constructions of Ahmad Computability	2023-01-12	Paper
Computability and the symmetric difference operator Logic Journal of the IGPL	2022-07-22	Paper
On the isomorphism problem for some classes of computable algebraic structures Archive for Mathematical Logic	2022-07-15	Paper
The first-order theory of the computably enumerable equivalence relations in the uncountable setting Journal Of Logic And Computation	2022-02-08	Paper
Building models of strongly minimal theories Advances in Mathematics	2021-07-05	Paper
Fragments of the theory of the enumeration degrees Advances in Mathematics	2021-04-23	Paper
On the order dimension of locally countable partial orderings Proceedings of the American Mathematical Society	2020-05-27	Paper
Reductions between types of numberings Annals of Pure and Applied Logic	2019-10-07	Paper
On cototality and the skip operator in the enumeration degrees Transactions of the American Mathematical Society	2019-07-03	Paper
Interval dismantlable lattices Order	2018-04-10	Paper
Corrigendum: "On the complexity of the successivity relation in computable linear orderings" Journal of Mathematical Logic	2017-12-04	Paper
Corrigendum to: ``The d.r.e. degrees are not dense Annals of Pure and Applied Logic	2017-09-29	Paper
Theory spectra and classes of theories Transactions of the American Mathematical Society	2017-06-14	Paper
Kenneth Kunen, The Foundations of Mathematics, Studies in Logic, Mathematical Logic and Foundations, vol. 19. College Publications, London, 2009, vii + 251 pp. The Bulletin of Symbolic Logic	2017-05-26	Paper
THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES Journal of Symbolic Logic	2017-04-28	Paper
Nondensity of Double Bubbles in the D.C.E. Degrees Computability and Complexity	2017-04-04	Paper
Defining totality in the enumeration degrees Journal of the American Mathematical Society	2016-07-25	Paper
On Kalimullin pairs Computability	2016-07-25	Paper
Asymptotic density, computable traceability, and 1-randomness Fundamenta Mathematicae	2016-07-08	Paper
On the existence of a strong minimal pair Journal of Mathematical Logic	2015-08-14	Paper
On the structure of the degrees of relative provability Israel Journal of Mathematics	2015-06-26	Paper
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA Journal of Symbolic Logic	2015-05-20	Paper
Computability and uncountable linear orders. I: Computable categoricity. Journal of Symbolic Logic	2015-05-20	Paper
A survey of results on the d.c.e. and \(n\)-c.e. degrees Lobachevskii Journal of Mathematics	2015-03-17	Paper
Lowness for effective Hausdorff dimension Journal of Mathematical Logic	2015-03-03	Paper
The complexity of computable categoricity Advances in Mathematics	2014-11-17	Paper
Universal computably enumerable equivalence relations The Journal of Symbolic Logic	2014-09-30	Paper
Random strings and truth-table degrees of Turing complete c.e. sets Logical Methods in Computer Science	2014-09-30	Paper
Computable categoricity versus relative computable categoricity Fundamenta Mathematicae	2013-05-10	Paper
Downward closure of depth in countable Boolean algebras Algebra Universalis	2012-11-27	Paper
On the complexity of the successivity relation in computable linear orderings Journal of Mathematical Logic	2011-10-24	Paper
On Downey's conjecture Journal of Symbolic Logic	2010-06-24	Paper
On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics Proceedings of the American Mathematical Society	2010-03-31	Paper
Comparing notions of randomness Theoretical Computer Science	2010-02-05	Paper
On computable self-embeddings of computable linear orderings Journal of Symbolic Logic	2010-01-07	Paper
A decomposition of the Rogers semilattice of a family of d.c.e. sets Journal of Symbolic Logic	2009-06-04	Paper
Stability and posets Journal of Symbolic Logic	2009-06-04	Paper
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs (available as arXiv preprint)	2008-10-20	Paper
Generating sets for the recursively enumerable Turing degrees	2008-10-20	Paper
Subspaces of computable vector spaces Journal of Algebra	2007-10-17	Paper
Ideals in computable rings Journal of Algebra	2007-10-17	Paper
On the computability-theoretic complexity of trivial, strongly minimal models Proceedings of the American Mathematical Society	2007-09-27	Paper
Filters on computable posets Notre Dame Journal of Formal Logic	2007-08-01	Paper
scientific article; zbMATH DE number 5175704 (Why is no real title available?) (available as arXiv preprint)	2007-07-30	Paper
Embedding finite lattices into the computably enumerable degrees -- a status survey	2006-10-17	Paper
ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS Journal of Mathematical Logic	2006-04-06	Paper
Computable categoricity of trees of finite height Journal of Symbolic Logic	2006-02-08	Paper
COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS International Journal of Algebra and Computation	2005-09-12	Paper
Comparing DNR and WWKL Journal of Symbolic Logic	2005-08-29	Paper
scientific article; zbMATH DE number 2167508 (Why is no real title available?)	2005-05-12	Paper
Computability-theoretic and proof-theoretic aspects of partial and linear orderings Israel Journal of Mathematics	2004-03-17	Paper
Trivial, strongly minimal theories are model complete after naming constants Proceedings of the American Mathematical Society	2003-09-10	Paper
Group theoretic properties of the group of computable automorphisms of a countable dense linear order Order	2003-06-09	Paper
The computable dimension of ordered abelian groups Advances in Mathematics	2003-05-27	Paper
THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS Journal of Mathematical Logic	2003-05-15	Paper
Decidability and undecidability in the enumerable Turing degrees	2003-02-16	Paper
Embedding finite lattices into the Σ20 enumeration degrees Journal of Symbolic Logic	2002-10-29	Paper
A \(\Delta_2^0\) set with no infinite low subset in either it or its complement The Journal of Symbolic Logic	2002-07-18	Paper
On the filter of computably enumerable supersets of an r-maximal set Archive for Mathematical Logic	2001-12-13	Paper
Differences of Computably Enumerable Sets	2000-12-19	Paper
scientific article; zbMATH DE number 1421071 (Why is no real title available?)	2000-12-17	Paper
A set with barely degree Journal of Symbolic Logic	2000-12-17	Paper
Constructive models of uncountably categorical theories Proceedings of the American Mathematical Society	1999-10-28	Paper
Infima in the recursively enumerable weak truth table degrees Notre Dame Journal of Formal Logic	1999-04-08	Paper
Initial segments of recursive linear orders Order	1999-03-25	Paper
scientific article; zbMATH DE number 1222581 (Why is no real title available?)	1999-03-02	Paper
Iterated trees of strategies and priority arguments Archive for Mathematical Logic	1998-11-02	Paper
Contiguity and distributivity in the enumerable Turing degrees Journal of Symbolic Logic	1998-10-19	Paper
The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable Transactions of the American Mathematical Society	1998-09-10	Paper
The computational complexity of torsion-freeness of finitely presented groups Bulletin of the Australian Mathematical Society	1998-05-29	Paper
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees Annals of Pure and Applied Logic	1998-03-23	Paper
Infinite versions of some problems from finite complexity theory Notre Dame Journal of Formal Logic	1998-03-12	Paper
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices Journal of Symbolic Logic	1997-06-03	Paper
The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations Advances in Mathematics	1997-02-24	Paper
Interpolating \(d\)-r.e. and REA degrees between r.e. degrees Annals of Pure and Applied Logic	1997-02-09	Paper
Jumps of Minimal Degrees Below 0 ′ Journal of the London Mathematical Society	1996-12-12	Paper
An extended Lachlan splitting theorem Annals of Pure and Applied Logic	1996-07-23	Paper
scientific article; zbMATH DE number 841082 (Why is no real title available?)	1996-06-19	Paper
The undecidability of the Π4-theory for the r.e. wtt and Turing degrees Journal of Symbolic Logic	1996-06-13	Paper
A General Framework for Priority Arguments The Bulletin of Symbolic Logic	1995-09-20	Paper
scientific article; zbMATH DE number 733390 (Why is no real title available?)	1995-08-27	Paper
Highness and bounding minimal pairs Mathematical Logic Quarterly	1994-08-31	Paper
There is no plus-capping degree Archive for Mathematical Logic	1994-07-07	Paper
Lattice Embeddings into the R.E. Degrees Preserving 0 and 1 Journal of the London Mathematical Society	1994-04-27	Paper
The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility Journal of Symbolic Logic	1993-04-01	Paper
The d.r.e. degrees are not dense Annals of Pure and Applied Logic	1992-06-28	Paper
scientific article; zbMATH DE number 4150132 (Why is no real title available?)	1990-01-01	Paper
Jumps of nontrivial splittings of recursively enumerable sets Mathematical Logic Quarterly	1990-01-01	Paper
Weak density and cupping in the d-r.e. degrees Israel Journal of Mathematics	1989-01-01	Paper
A limit on relative genericity in the recursively enumerable sets Journal of Symbolic Logic	1989-01-01	Paper
A high strongly noncappable degree Journal of Symbolic Logic	1988-01-01	Paper
Hyperarithmetical Index Sets in Recursion Theory	1987-01-01	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
Finite final segments of the d.c.e. Turing degrees (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Steffen Lempp