default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteffen Lempp
Person information
- affiliation: University of Wisconsin Madison, Department of Mathematics, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j57]Iskander Sh. Kalimullin, Steffen Lempp
, Keng Meng Ng, Mars M. Yamaleev:
On cupping and Ahmad Pairs. J. Symb. Log. 89(3): 1358-1369 (2024)- 2023
- [j56]Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova:
Maximal Towers and Ultrafilter Bases in Computability Theory. J. Symb. Log. 88(3): 1170-1190 (2023) - [e1]Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea:
Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings. Lecture Notes in Computer Science 13967, Springer 2023, ISBN 978-3-031-36977-3 [contents] - [i2]Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti:
Minimal covers in the Weihrauch degrees. CoRR abs/2311.12676 (2023) - 2022
- [j55]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): 813-825 (2022) - [j54]Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova:
Extensions of two constructions of Ahmad. Comput. 11(3-4): 269-297 (2022) - [j53]Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber:
Computability and the Symmetric Difference Operator. Log. J. IGPL 30(3): 499-518 (2022) - [j52]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): 98-114 (2022) - 2020
- [j51]Andrey N. Frolov, Steffen Lempp, Keng Meng Ng, Guohua Wu:
Computable linear Orders and Products. J. Symb. Log. 85(2): 605-623 (2020)
2010 – 2019
- 2019
- [j50]Ian Herbert, Sanjay Jain, Steffen Lempp, Manat Mustafa, Frank Stephan:
Reductions between types of numberings. Ann. Pure Appl. Log. 170(12) (2019) - [j49]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): 191 (2019) - 2018
- [j48]Kira V. Adaricheva, Jennifer Hyndman, Steffen Lempp, James B. Nation:
Interval Dismantlable Lattices. Order 35(1): 133-137 (2018) - 2017
- [j47]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): 2164-2165 (2017) - [c2]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: 547-562 - [i1]Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp:
Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports 7(2): 89-101 (2017) - 2016
- [j46]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): 287-288 (2016) - [j45]Mingzhong Cai, Steffen Lempp, Joseph S. Miller, Mariya Ivanova Soskova:
On Kalimullin pairs. Comput. 5(2): 111-126 (2016) - [j44]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): 997-1006 (2016) - 2015
- [j43]George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman:
On the existence of a strong minimal pair. J. Math. Log. 15(1): 1550003:1-1550003:28 (2015) - [j42]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky:
Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. 80(1): 116-144 (2015) - [j41]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky:
Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. 80(1): 145-178 (2015) - 2014
- [j40]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): 201-202 (2014) - [j39]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) - [j38]Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky, Rebecca Weber:
Lowness for effective Hausdorff dimension. J. Math. Log. 14(2): 1450011 (2014) - [j37]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): 60-88 (2014) - 2010
- [j36]Rod Downey, Steffen Lempp, Guohua Wu:
On the Complexity of the Successivity Relation in Computable linear Orderings. J. Math. Log. 10(1-2) (2010) - [j35]Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp:
On Downey's conjecture. J. Symb. Log. 75(2): 401-441 (2010) - [j34]Bart Kastermans, Steffen Lempp:
Comparing notions of randomness. Theor. Comput. Sci. 411(3): 602-616 (2010)
2000 – 2009
- 2009
- [j33]Serikzhan A. Badaev, Steffen Lempp:
A decomposition of the Rogers semilattice of a family of d.c.e. sets. J. Symb. Log. 74(2): 618-640 (2009) - [j32]Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon:
Stability and posets. J. Symb. Log. 74(2): 693-711 (2009) - [j31]Rodney G. Downey, Bart Kastermans, Steffen Lempp:
On computable self-embeddings of computable linear orderings. J. Symb. Log. 74(4): 1352-1366 (2009) - 2006
- [j30]Steffen Lempp, Carl Mummert:
Filters on Computable Posets. Notre Dame J. Formal Log. 47(4): 479-485 (2006) - 2005
- [j29]Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman:
Computably Enumerable Algebras, Their Expansions, and Isomorphisms. Int. J. Algebra Comput. 15(3): 437-454 (2005) - [j28]Steffen Lempp, Theodore A. Slaman, Andrea Sorbi:
On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. 5(2) (2005) - [j27]Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon:
Computable categoricity of trees of finite height. J. Symb. Log. 70(1): 151-215 (2005) - 2004
- [j26]Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman:
Comparing DNR and WWKL. J. Symb. Log. 69(4): 1089-1104 (2004) - 2002
- [j25]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) - [j24]Steffen Lempp, Andrea Sorbi:
Embedding Finite Lattices into the Sigma02 Enumeration Degrees. J. Symb. Log. 67(1): 69-90 (2002) - [j23]Rodney G. Downey, Steffen Lempp:
Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. J. Symb. Log. 67(4): 1579-1580 (2002) - [j22]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): 343-364 (2002) - 2001
- [j21]Steffen Lempp, André Nies, Reed Solomon:
On the filter of computably enumerable supersets of an r-maximal set. Arch. Math. Log. 40(6): 415-423 (2001) - [j20]Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon:
A delta02 Set with No Infinite Low Subset in Either It or Its Complement. J. Symb. Log. 66(3): 1371-1381 (2001) - 2000
- [j19]Steffen Lempp, André Nies:
Differences of Computably Enumerable Sets. Math. Log. Q. 46(4): 555-561 (2000)
1990 – 1999
- 1999
- [j18]Rodney G. Downey, Geoffrey LaForte, Steffen Lempp:
A Delta02 Set With Barely Sigma02 Degree. J. Symb. Log. 64(4): 1700-1718 (1999) - 1998
- [c1]Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt:
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. MFCS 1998: 465-473 - 1997
- [j17]Steffen Lempp, Manuel Lerman:
Iterated trees of strategies and priority arguments. Arch. Math. Log. 36(4-5): 297-312 (1997) - [j16]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): 167-185 (1997) - [j15]Rodney G. Downey, Steffen Lempp:
Contiguity and Distributivity in the Enumerable Turing Degrees. J. Symb. Log. 62(4): 1215-1240 (1997) - [j14]Rich Blaylock, Rodney G. Downey, Steffen Lempp:
Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame J. Formal Log. 38(3): 406-418 (1997) - 1996
- [j13]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): 29-56 (1996) - [j12]Steffen Lempp, Yuefei Sui:
An Extended Lachlan Splitting Theorem. Ann. Pure Appl. Log. 79(1): 53-59 (1996) - [j11]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): 880-905 (1996) - [j10]Jeffry L. Hirst, Steffen Lempp:
Infinite Versions of Some Problems From Finite Complexity Theory. Notre Dame J. Formal Log. 37(4): 545-553 (1996) - 1995
- [j9]Steffen Lempp, Manuel Lerman:
A general framework for priority arguments. Bull. Symb. Log. 1(2): 189-201 (1995) - [j8]Steffen Lempp, André Nies:
The Undecidability of the Pi4-Theory for the R. E. WTT and Turing Degrees. J. Symb. Log. 60(4): 1118-1136 (1995) - 1994
- [j7]Rodney G. Downey, Steffen Lempp:
There is no plus-capping degree. Arch. Math. Log. 33(2): 109-119 (1994) - 1993
- [j6]Steffen Lempp, Rodney G. Downey, Richard A. Shore:
Highness and Bounding Minimal Pairs. Math. Log. Q. 39: 475-491 (1993) - 1992
- [j5]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): 1120-1130 (1992) - 1991
- [j4]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): 125-151 (1991) - 1990
- [j3]Michael A. Ingrassia, Steffen Lempp:
Jumps of nontrivial splittings of recursively enumerable sets. Math. Log. Q. 36(4): 285-292 (1990)
1980 – 1989
- 1989
- [j2]Steffen Lempp, Theodore A. Slaman:
A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. 54(2): 376-395 (1989) - 1988
- [j1]Steffen Lempp:
A High Strongly Noncappable Degree. J. Symb. Log. 53(1): 174-187 (1988)
Coauthor Index
aka: Rod Downey
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
