Steffen Lempp

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 16

Top Topics

Sound And Complete Axiomatization

Symmetric Difference

Type Fuzzy Logic Systems

Merging Operators

Top Venues

Bull. Symb. Log.

Ann. Pure Appl. Log.

Publications

Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti
Minimal covers in the Weihrauch degrees. CoRR (2023)
Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova
Maximal Towers and Ultrafilter Bases in Computability Theory. J. Symb. Log. 88 (3) (2023)
Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova
Extensions of two constructions of Ahmad. Comput. 11 (3-4) (2022)
Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber
Computability and the Symmetric Difference Operator. Log. J. IGPL 30 (3) (2022)
Uri Andrews, Steffen Lempp, Manat Mustafa, Noah David Schweber
The first-order theory of the computably enumerable equivalence relations in the uncountable setting. J. Log. Comput. 32 (1) (2022)
Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon
On the isomorphism problem for some classes of computable algebraic structures. Arch. Math. Log. 61 (5-6) (2022)
Andrey N. Frolov, Steffen Lempp, Keng Meng Ng, Guohua Wu
Computable linear Orders and Products. J. Symb. Log. 85 (2) (2020)
Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp
Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. Comput. 8 (3-4) (2019)
Ian Herbert, Sanjay Jain, Steffen Lempp, Manat Mustafa, Frank Stephan
Reductions between types of numberings. Ann. Pure Appl. Log. 170 (12) (2019)
Kira V. Adaricheva, Jennifer Hyndman, Steffen Lempp, James B. Nation
Interval Dismantlable Lattices. Order 35 (1) (2018)
Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp
Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports 7 (2) (2017)
Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev
Nondensity of Double Bubbles in the D.C.E. Degrees. Computability and Complexity (2017)
S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. Ann. Pure Appl. Log. 168 (12) (2017)
Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán
The complements of Lower cones of Degrees and the degree spectra of Structures. J. Symb. Log. 81 (3) (2016)
Mingzhong Cai, Steffen Lempp, Joseph S. Miller, Mariya Ivanova Soskova
On Kalimullin pairs. Comput. 5 (2) (2016)
Steffen Lempp
Kenneth Kunen, The Foundations of Mathematics, Studies in Logic, Mathematical Logic and Foundations, vol. 19. College Publications, London, 2009, vii + 251 pp. Bull. Symb. Log. 22 (2) (2016)
George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman
On the existence of a strong minimal pair. J. Math. Log. 15 (1) (2015)
Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky
Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. 80 (1) (2015)
Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky
Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. 80 (1) (2015)
Steffen Lempp
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. Bull. Symb. Log. 20 (2) (2014)
Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky, Rebecca Weber
Lowness for effective Hausdorff dimension. J. Math. Log. 14 (2) (2014)
Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller
Random strings and tt-degrees of Turing complete C.E. sets. Log. Methods Comput. Sci. 10 (3) (2014)
Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Universal computably Enumerable Equivalence Relations. J. Symb. Log. 79 (1) (2014)
Bart Kastermans, Steffen Lempp
Comparing notions of randomness. Theor. Comput. Sci. 411 (3) (2010)
Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp
On Downey's conjecture. J. Symb. Log. 75 (2) (2010)
Rod Downey, Steffen Lempp, Guohua Wu
On the Complexity of the Successivity Relation in Computable linear Orderings. J. Math. Log. 10 (1-2) (2010)
Rodney G. Downey, Bart Kastermans, Steffen Lempp
On computable self-embeddings of computable linear orderings. J. Symb. Log. 74 (4) (2009)
Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon
Stability and posets. J. Symb. Log. 74 (2) (2009)
Serikzhan A. Badaev, Steffen Lempp
A decomposition of the Rogers semilattice of a family of d.c.e. sets. J. Symb. Log. 74 (2) (2009)
Steffen Lempp, Carl Mummert
Filters on Computable Posets. Notre Dame J. Formal Log. 47 (4) (2006)
Steffen Lempp, Theodore A. Slaman, Andrea Sorbi
On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. 5 (2) (2005)
Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman
Computably Enumerable Algebras, Their Expansions, and Isomorphisms. Int. J. Algebra Comput. 15 (3) (2005)
Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon
Computable categoricity of trees of finite height. J. Symb. Log. 70 (1) (2005)
Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman
Comparing DNR and WWKL. J. Symb. Log. 69 (4) (2004)
Steffen Lempp, Andrea Sorbi
Enumeration Degrees. J. Symb. Log. 67 (1) (2002)
Steffen Lempp, Mikhail G. Peretyat'kin, Reed Solomon
The Lindenbaum Algebra of the Theory of the class of All finite Models. J. Math. Log. 2 (2) (2002)
Rodney G. Downey, Steffen Lempp
Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. J. Symb. Log. 67 (4) (2002)
Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon
Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order. Order 19 (4) (2002)
Steffen Lempp, André Nies, Reed Solomon
On the filter of computably enumerable supersets of an r-maximal set. Arch. Math. Log. 40 (6) (2001)
Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon
Set with No Infinite Low Subset in Either It or Its Complement. J. Symb. Log. 66 (3) (2001)
Steffen Lempp, André Nies
Differences of Computably Enumerable Sets. Math. Log. Q. 46 (4) (2000)
Rodney G. Downey, Geoffrey LaForte, Steffen Lempp
Degree. J. Symb. Log. 64 (4) (1999)
Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. MFCS (1998)
Rodney G. Downey, Steffen Lempp
Contiguity and Distributivity in the Enumerable Turing Degrees. J. Symb. Log. 62 (4) (1997)
Steffen Lempp, Manuel Lerman
A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. Ann. Pure Appl. Log. 87 (2) (1997)
Steffen Lempp, Manuel Lerman
Iterated trees of strategies and priority arguments. Arch. Math. Log. 36 (4-5) (1997)
Rich Blaylock, Rodney G. Downey, Steffen Lempp
Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame J. Formal Log. 38 (3) (1997)
Jeffry L. Hirst, Steffen Lempp
Infinite Versions of Some Problems From Finite Complexity Theory. Notre Dame J. Formal Log. 37 (4) (1996)
Steffen Lempp, Yuefei Sui
An Extended Lachlan Splitting Theorem. Ann. Pure Appl. Log. 79 (1) (1996)
Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. J. Symb. Log. 61 (3) (1996)
Marat M. Arslanov, Steffen Lempp, Richard A. Shore
Interpolating d-r.e. and REA Degrees between r.e. Degrees. Ann. Pure Appl. Log. 78 (1-3) (1996)
Steffen Lempp, Manuel Lerman
A general framework for priority arguments. Bull. Symb. Log. 1 (2) (1995)
Steffen Lempp, André Nies
-Theory for the R. E. WTT and Turing Degrees. J. Symb. Log. 60 (4) (1995)
Rodney G. Downey, Steffen Lempp
There is no plus-capping degree. Arch. Math. Log. 33 (2) (1994)
Steffen Lempp, Rodney G. Downey, Richard A. Shore
Highness and Bounding Minimal Pairs. Math. Log. Q. 39 (1993)
Steffen Lempp, Manuel Lerman
The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility. J. Symb. Log. 57 (3) (1992)
S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Log. 55 (2) (1991)
Michael A. Ingrassia, Steffen Lempp
Jumps of nontrivial splittings of recursively enumerable sets. Math. Log. Q. 36 (4) (1990)
Steffen Lempp, Theodore A. Slaman
A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. 54 (2) (1989)
Steffen Lempp
A High Strongly Noncappable Degree. J. Symb. Log. 53 (1) (1988)