Steffen Lempp

According to our database, Steffen Lempp authored at least 61 papers between 1988 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On cupping and Ahmad Pairs.

Iskander Sh. Kalimullin, Steffen Lempp, Keng Meng Ng, Mars M. Yamaleev

J. Symb. Log., 2024

2023

Maximal Towers and Ultrafilter Bases in Computability Theory.

Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova

J. Symb. Log., 2023

Minimal covers in the Weihrauch degrees.

Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti

CoRR, 2023

2022

The first-order theory of the computably enumerable equivalence relations in the uncountable setting.

Uri Andrews, Steffen Lempp, Manat Mustafa, Noah David Schweber

J. Log. Comput., 2022

Computability and the Symmetric Difference Operator.

Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber

Log. J. IGPL, 2022

Extensions of two constructions of Ahmad.

Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova

Comput., 2022

On the isomorphism problem for some classes of computable algebraic structures.

Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon

Arch. Math. Log., 2022

2020

Computable linear Orders and Products.

Andrey N. Frolov, Steffen Lempp, Keng Meng Ng, Guohua Wu

J. Symb. Log., 2020

2019

Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018.

Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp

Comput., 2019

Reductions between types of numberings.

Ian Herbert, Sanjay Jain, Steffen Lempp, Manat Mustafa, Frank Stephan

Ann. Pure Appl. Log., 2019

2018

Interval Dismantlable Lattices.

Kira V. Adaricheva, Jennifer Hyndman, Steffen Lempp, James B. Nation

Order, 2018

2017

Computability Theory (Dagstuhl Seminar 17081).

Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp

Dagstuhl Reports, 2017

Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151].

S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare

Ann. Pure Appl. Log., 2017

Nondensity of Double Bubbles in the D.C.E. Degrees.

Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev

Proceedings of the Computability and Complexity, 2017

2016

The complements of Lower cones of Degrees and the degree spectra of Structures.

Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán

J. Symb. Log., 2016

On Kalimullin pairs.

Mingzhong Cai, Steffen Lempp, Joseph S. Miller, Mariya Ivanova Soskova

Comput., 2016

Kenneth Kunen, The Foundations of Mathematics, Studies in Logic, Mathematical Logic and Foundations, vol. 19. College Publications, London, 2009, vii + 251 pp.

Steffen Lempp

Bull. Symb. Log., 2016

2015

Computability and uncountable Linear Orders II: degree spectra.

Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky

J. Symb. Log., 2015

Computability and uncountable Linear Orders I: Computable Categoricity.

Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky

J. Symb. Log., 2015

On the existence of a strong minimal pair.

George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman

J. Math. Log., 2015

2014

Universal computably Enumerable Equivalence Relations.

Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi

J. Symb. Log., 2014

Lowness for effective Hausdorff dimension.

Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky, Rebecca Weber

J. Math. Log., 2014

Random strings and tt-degrees of Turing complete C.E. sets.

Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller

Log. Methods Comput. Sci., 2014

Ulrich Felgner. Das Induktions-Prinzip. Jahresbericht der Deutschen Mathematiker-Vereinigung. vol. 114, no. 1 (2012), pp. 23-45. - Ulrich Felgner. Hilbert's "Grundlagen der Geometrie" und ihre Stellung in der Geschichte der Grundlagendiskussion. Jahresbericht der Deutschen Mathematiker-Vereinigung. vol. 115, no. 3-4 (2014), pp. 185-206.

Steffen Lempp

Bull. Symb. Log., 2014

2010

Comparing notions of randomness.

Bart Kastermans, Steffen Lempp

Theor. Comput. Sci., 2010

On Downey's conjecture.

Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp

J. Symb. Log., 2010

On the Complexity of the Successivity Relation in Computable linear Orderings.

Rod Downey, Steffen Lempp, Guohua Wu

J. Math. Log., 2010

2009

Stability and posets.

Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon

J. Symb. Log., 2009

On computable self-embeddings of computable linear orderings.

Rodney G. Downey, Bart Kastermans, Steffen Lempp

J. Symb. Log., 2009

A decomposition of the Rogers semilattice of a family of d.c.e. sets.

Serikzhan A. Badaev, Steffen Lempp

J. Symb. Log., 2009

2006

Filters on Computable Posets.

Steffen Lempp, Carl Mummert

Notre Dame J. Formal Log., 2006

2005

Computable categoricity of trees of finite height.

Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon

J. Symb. Log., 2005

On Extensions of Embeddings into the Enumeration Degrees of the -Sets.

Steffen Lempp, Theodore A. Slaman, Andrea Sorbi

J. Math. Log., 2005

Computably Enumerable Algebras, Their Expansions, and Isomorphisms.

Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman

Int. J. Algebra Comput., 2005

2004

Comparing DNR and WWKL.

Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman

J. Symb. Log., 2004

2002

Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order.

Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon

Order, 2002

Embedding Finite Lattices into the Sigma⁰₂ Enumeration Degrees.

Steffen Lempp, Andrea Sorbi

J. Symb. Log., 2002

Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum.

Rodney G. Downey, Steffen Lempp

J. Symb. Log., 2002

The Lindenbaum Algebra of the Theory of the class of All finite Models.

Steffen Lempp, Mikhail G. Peretyat'kin, Reed Solomon

J. Math. Log., 2002

2001

A delta⁰₂ Set with No Infinite Low Subset in Either It or Its Complement.

Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon

J. Symb. Log., 2001

On the filter of computably enumerable supersets of an r-maximal set.

Steffen Lempp, André Nies, Reed Solomon

Arch. Math. Log., 2001

2000

Differences of Computably Enumerable Sets.

Steffen Lempp, André Nies

Math. Log. Q., 2000

1999

A Delta⁰₂ Set With Barely Sigma⁰₂ Degree.

Rodney G. Downey, Geoffrey LaForte, Steffen Lempp

J. Symb. Log., 1999

1998

Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets.

Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Infima in the Recursively Enumerable Weak Truth Table Degrees.

Rich Blaylock, Rodney G. Downey, Steffen Lempp

Notre Dame J. Formal Log., 1997

Contiguity and Distributivity in the Enumerable Turing Degrees.

Rodney G. Downey, Steffen Lempp

J. Symb. Log., 1997

A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees.

Steffen Lempp, Manuel Lerman

Ann. Pure Appl. Log., 1997

Iterated trees of strategies and priority arguments.

Steffen Lempp, Manuel Lerman

Arch. Math. Log., 1997

1996

Infinite Versions of Some Problems From Finite Complexity Theory.

Jeffry L. Hirst, Steffen Lempp

Notre Dame J. Formal Log., 1996

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.

Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman

J. Symb. Log., 1996

An Extended Lachlan Splitting Theorem.

Steffen Lempp, Yuefei Sui

Ann. Pure Appl. Log., 1996

Interpolating d-r.e. and REA Degrees between r.e. Degrees.

Marat M. Arslanov, Steffen Lempp, Richard A. Shore

Ann. Pure Appl. Log., 1996

1995

The Undecidability of the Pi₄-Theory for the R. E. WTT and Turing Degrees.

Steffen Lempp, André Nies

J. Symb. Log., 1995

A general framework for priority arguments.

Steffen Lempp, Manuel Lerman

Bull. Symb. Log., 1995

1994

There is no plus-capping degree.

Rodney G. Downey, Steffen Lempp

Arch. Math. Log., 1994

1993

Highness and Bounding Minimal Pairs.

Steffen Lempp, Rodney G. Downey, Richard A. Shore

Math. Log. Q., 1993

1992

The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility.

Steffen Lempp, Manuel Lerman

J. Symb. Log., 1992

1991

The d.r.e. Degrees are Not Dense.

S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare

Ann. Pure Appl. Log., 1991

1990

Jumps of nontrivial splittings of recursively enumerable sets.

Michael A. Ingrassia, Steffen Lempp

Math. Log. Q., 1990

1989

A Limit on Relative Genericity in the Recursively Enumerable Sets.

Steffen Lempp, Theodore A. Slaman

J. Symb. Log., 1989

1988

A High Strongly Noncappable Degree.

Steffen Lempp

J. Symb. Log., 1988