×

zbMATH — the first resource for mathematics

Lempp, Steffen

Compute Distance To:
Author ID: lempp.steffen Recent zbMATH articles by "Lempp, Steffen"
Published as: Lempp, Steffen; Lempp, S.
Documents Indexed: 96 Publications since 1987, including 2 Books
all top 5

Co-Authors

7 single-authored
20 Downey, Rodney Graham
13 Lerman, Manuel
11 Solomon, Reed
10 Slaman, Theodore A.
9 Miller, Joseph S.
8 Ambos-Spies, Klaus
8 Andrews, Uri
8 Cai, Mingzhong
6 Kach, Asher M.
5 Shore, Richard A.
5 Soskova, Mariya Ivanova
5 Turetsky, Daniel D.
4 Arslanov, Marat M.
4 Cooper, Stuart Barry
4 Hirschfeldt, Denis Roman
4 Nies, André Otfrid
3 Diamondstone, David E.
3 Goncharov, Sergeĭ Savost’yanovich
3 Jockusch, Carl G. jun.
3 Kastermans, Bart
3 McCoy, Charles F. D.
3 Montalbán, Antonio
3 Ng, KengMeng
3 Sorbi, Andrea
3 Wu, Guohua
2 Brattka, Vasco
2 Ganchev, Hristo A.
2 Greenberg, Noam
2 Harrington, Leo A.
2 Kalimullin, Iskander Shagitovich
2 Khoussainov, Bakhadyr M.
2 Kjos-Hanssen, Bjørn
2 Knight, Julia F.
2 Kuyper, Rutger
2 Lachlan, Alistair H.
2 Laskowski, Michael Chris
2 Mileti, Joseph R.
2 Soare, Robert I.
2 Stephan, Frank
1 Adaricheva, Kira Vladislavovna
1 Badaev, Serikzhan A.
1 Barmpalias, George
1 Blaylock, Rich
1 Cholak, Peter A.
1 Chong, Chi Tat
1 Epstein, Rachel
1 Fejer, Peter A.
1 Frolov, Andrey N.
1 Harizanov, Valentina S.
1 Herbert, Ian
1 Herwig, Bernhard
1 Higuchi, Kojiro
1 Hirst, Jeffry Lynn
1 Hyndman, Jennifer
1 Ingrassia, Michael A.
1 Jain, Sanjay
1 LaForte, Geoffrey L.
1 Lewis-Pye, Andrew E. M.
1 Mainhardt, Gunther
1 Merkle, Wolfgang
1 Miller, Russel G.
1 Morozov, Andreĭ Sergeevich
1 Mummert, Carl
1 Mustafa, Manat
1 Nation, James B.
1 Peretyat’kin, Mikhail G.
1 Raghavan, Dilip
1 San Mauro, Luca
1 Schweber, Noah David
1 Soskova, Alexandra A.
1 Sui, Yuefei
1 Watson, Philip
1 Weber, Rebecca
1 Yamaleev, Mars Mansurovich
1 Yang, Yue
1 Ziegler, Martin

Publications by Year

Citations contained in zbMATH Open

72 Publications have been cited 518 times in 368 Documents Cited by Year
The d.r.e. degrees are not dense. Zbl 0756.03020
Cooper, S. Barry; Harrington, Leo; Lachlan, Alistair H.; Lempp, Steffen; Soare, Robert I.
38
1991
On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics. Zbl 1195.03015
Chong, C. T.; Lempp, Steffen; Yang, Yue
26
2010
Comparing DNR and WWKL. Zbl 1076.03039
Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
26
2004
Weak density and cupping in the d-r.e. degrees. Zbl 0691.03023
Cooper, S. Barry; Lempp, Steffen; Watson, Philip
25
1989
The complexity of computable categoricity. Zbl 1345.03063
Downey, Rodney G.; Kach, Asher M.; Lempp, Steffen; Lewis-Pye, Andrew E. M.; Montalbán, Antonio; Turetsky, Daniel D.
23
2015
The computable dimension of ordered abelian groups. Zbl 1031.03058
Goncharov, Sergey S.; Lempp, Steffen; Solomon, Reed
18
2003
Friedberg numberings of families of \(n\)-computably enumerable sets. Zbl 1063.03028
Goncharov, S. S.; Lempp, Steffen; Solomon, D. R.
17
2002
Computable categoricity of trees of finite height. Zbl 1104.03026
Lempp, Steffen; McCoy, Charles; Miller, Russel; Solomon, Reed
16
2005
A \(\Delta_2^0\) set with no infinite low subset in either it or its complement. Zbl 0990.03046
Downey, Rod; Hirschfeldt, Denis R.; Lempp, Steffen; Solomon, Reed
16
2001
The \(\Pi_{3}\)-theory of the computably enumerable Turing degrees is undecidable. Zbl 0904.03029
Lempp, Steffen; Nies, André; Slaman, Theodore A.
15
1998
Universal computably enumerable equivalence relations. Zbl 1338.03076
Andrews, Uri; Lempp, Steffen; Miller, Joseph S.; Ng, Keng Meng; San Mauro, Luca; Sorbi, Andrea
14
2014
Hyperarithmetical index sets in recursion theory. Zbl 0652.03030
Lempp, Steffen
14
1987
Subspaces of computable vector spaces. Zbl 1127.03036
Downey, Rodney G.; Hirschfeldt, Denis R.; Kach, Asher M.; Lempp, Steffen; Mileti, Joseph R.; Montalbán, Antonio
13
2007
Highness and bounding minimal pairs. Zbl 0809.03029
Downey, Rodney G.; Lempp, Steffen; Shore, Richard A.
11
1993
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Zbl 0883.03025
Lempp, Steffen; Lerman, Manuel
11
1997
On isolating r.e. and isolated d-r.e. degrees. Zbl 0839.03024
Arslanov, Marat M.; Lempp, Steffen; Shore, Richard A.
11
1996
Trivial, strongly minimal theories are model complete after naming constants. Zbl 1035.03013
Goncharov, Sergey S.; Harizanov, Valentina S.; Laskowski, Michael C.; Lempp, Steffen; McCoy, Charles F. D.
11
2003
On Downey’s conjecture. Zbl 1192.03017
Arslanov, Marat M.; Kalimullin, Iskander Sh.; Lempp, Steffen
11
2010
The strength of some combinatorial principles related to Ramsey’s theorem for pairs. Zbl 1167.03009
Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
10
2008
Ideals in computable rings. Zbl 1127.03037
Downey, Rodney G.; Lempp, Steffen; Mileti, Joseph R.
9
2007
Computability-theoretic and proof-theoretic aspects of partial and linear orderings. Zbl 1044.03043
Downey, Rodney G.; Hirschfeldt, Denis R.; Lempp, Steffen; Solomon, Reed
9
2003
A decomposition of the Rogers semilattice of a family of d.c.e. sets. Zbl 1185.03071
Badaev, Serikzhan A.; Lempp, Steffen
8
2009
Contiguity and distributivity in the enumerable Turing degrees. Zbl 0897.03047
Downey, Rodney G.; Lempp, Steffen
7
1997
Defining totality in the enumeration degrees. Zbl 1402.03061
Cai, Mingzhong; Ganchev, Hristo A.; Lempp, Steffen; Miller, Joseph S.; Soskova, Mariya I.
7
2016
A limit on relative genericity in the recursively enumerable sets. Zbl 0699.03023
Lempp, Steffen; Slaman, Theodore A.
6
1989
The computational complexity of torsion-freeness of finitely presented groups. Zbl 0889.03033
Lempp, Steffen
6
1997
The complexity of the index sets of \(\aleph_0\)-categorical theories and of Ehrenfeucht theories. Zbl 1123.03035
Lempp, Steffen; Slaman, Theodore A.
6
2007
Constructive models of uncountably categorical theories. Zbl 0932.03036
Herwig, Bernhard; Lempp, Steffen; Ziegler, Martin
6
1999
On the complexity of the successivity relation in computable linear orderings. Zbl 1256.03039
Downey, Rod; Lempp, Steffen; Wu, Guohua
6
2010
On extensions of embeddings into the enumeration degrees of the \({\Sigma_2^0}\)-sets. Zbl 1097.03036
Lempp, Steffen; Slaman, Theodore A.; Sorbi, Andrea
5
2005
The undecidability of the \(\Pi_ 4\)-theory for the r.e. wtt and Turing degrees. Zbl 0846.03018
Lempp, Steffen; Nies, André
5
1995
The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations. Zbl 0856.03034
Lempp, Steffen; Lerman, Manuel
5
1996
On the computability-theoretic complexity of trivial, strongly minimal models. Zbl 1124.03016
Khoussainov, Bakhadyr M.; Laskowski, Michael C.; Lempp, Steffen; Solomon, Reed
5
2007
Initial segments of recursive linear orders. Zbl 0909.03034
Ambos-Spies, Klaus; Cooper, S. Barry; Lempp, Steffen
5
1998
Lattice embeddings into the r.e. degrees preserving 0 and 1. Zbl 0808.03027
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
5
1994
On computable self-embeddings of computable linear orderings. Zbl 1201.03029
Downey, Rodney G.; Kastermans, Bart; Lempp, Steffen
5
2009
A general framework for priority arguments. Zbl 0841.03025
Lempp, Steffen; Lerman, Manuel
4
1995
Computably enumerable algebras, their expansions, and isomorphisms. Zbl 1096.03050
Khoussainov, Bakhadyr; Lempp, Steffen; Slaman, Theodore A.
4
2005
Embedding finite lattices into the computably enumerable degrees – a status survey. Zbl 1107.03046
Lempp, Steffen; Lerman, Manuel; Solomon, Reed
4
2006
Asymptotic density, computable traceability, and 1-randomness. Zbl 1401.03074
Andrews, Uri; Cai, Mingzhong; Diamondstone, David; Jockusch, Carl; Lempp, Steffen
4
2016
Computable categoricity versus relative computable categoricity. Zbl 1320.03070
Downey, Rodney G.; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
4
2013
Comparing notions of randomness. Zbl 1184.68274
Kastermans, Bart; Lempp, Steffen
4
2010
Stability and posets. Zbl 1171.03034
Jockusch, Carl G. jun.; Kastermans, Bart; Lempp, Steffen; Lerman, Manuel; Solomon, Reed
3
2009
On the existence of a strong minimal pair. Zbl 1386.03044
Barmpalias, George; Cai, Mingzhong; Lempp, Steffen; Slaman, Theodore A.
3
2015
Reductions between types of numberings. Zbl 1439.03077
Herbert, Ian; Jain, Sanjay; Lempp, Steffen; Mustafa, Manat; Stephan, Frank
3
2019
Computability and uncountable linear orders. I: Computable categoricity. Zbl 1359.03034
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
3
2015
On the structure of the degrees of relative provability. Zbl 1367.03076
Andrews, Uri; Cai, Mingzhong; Diamondstone, David; Lempp, Steffen; Miller, Joseph S.
3
2015
Interpolating \(d\)-r.e. and REA degrees between r.e. degrees. Zbl 0855.03025
Arslanov, Marat; Lempp, Steffen; Shore, Richard A.
3
1996
On cototality and the skip operator in the enumeration degrees. Zbl 1457.03059
Andrews, Uri; Ganchev, Hristo A.; Kuyper, Rutger; Lempp, Steffen; Miller, Joseph S.; Soskova, Alexandra A.; Soskova, Mariya I.
3
2019
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices. Zbl 0863.03021
Ambos-Spies, Klaus; Fejer, Peter A.; Lempp, Steffen; Lerman, Manuel
3
1996
Differences of computably enumerable sets. Zbl 0964.03043
Lempp, Steffen; Nies, André
3
2000
The complements of lower cones of degrees and the degree spectra of structures. Zbl 1370.03060
Andrews, Uri; Cai, Mingzhong; Kalimullin, Iskander Sh.; Lempp, Steffen; Miller, Joseph S.; Montalbán, Antonio
3
2016
Theory spectra and classes of theories. Zbl 1423.03146
Andrews, Uri; Cai, Mingzhong; Diamondstone, David; Lempp, Steffen; Miller, Joseph S.
2
2017
Recursion theory and complexity. Proceedings of the Kazan ’97 workshop, Kazan, Russia, July 14–19, 1997. Zbl 0923.00014
Arslanov, Marat M. (ed.); Lempp, Steffen (ed.)
2
1999
The Lindenbaum algebra of the theory of the class of all finite models. Zbl 1033.03035
Lempp, Steffen; Peretyatkin, Mikhail; Solomon, Reed
2
2002
Random strings and truth-table degrees of Turing complete c.e. sets. Zbl 1314.03039
Cai, Mingzhong; Downey, Rodney G.; Epstein, Rachel; Lempp, Steffen; Miller, Joseph S.
2
2014
Computability and uncountable linear orders. II: Degree spectra. Zbl 1359.03035
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
2
2015
Priority arguments using iterated trees of strategies. Zbl 0702.03019
Lempp, Steffen; Lerman, Manuel
2
1990
The proof-theoretic strength of the Dushnik-Miller theorem for countable linear orders. Zbl 0951.03053
Downey, Rodney G.; Lempp, Steffen
2
1999
Filters on computable posets. Zbl 1128.03037
Lempp, Steffen; Mummert, Carl
2
2006
Iterated trees of strategies and priority arguments. Zbl 0899.03030
Lempp, Steffen; Lerman, Manuel
2
1997
Jumps of nontrivial splittings of recursively enumerable sets. Zbl 0687.03021
Ingrassia, Michael A.; Lempp, Steffen
2
1990
Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets. Zbl 0912.03023
Ambos-Spies, Klaus; Lempp, Steffen; Mainhardt, Gunther
2
1998
Embedding finite lattices into the \(\Sigma_2^0\) enumeration degrees. Zbl 1021.03035
Lempp, Steffen; Sorbi, Andrea
2
2002
On the filter of computably enumerable supersets of an r-maximal set. Zbl 1030.03029
Lempp, Steffen; Nies, André; Solomon, D. Reed
2
2001
Corrigendum to: “The d.r.e. degrees are not dense”. Zbl 1403.03063
Barry Cooper, S.; Harrington, Leo; Lachlan, Alistair H.; Lempp, Steffen; Soare, Robert I.
1
2017
Corrigendum to: “On the complexity of the successivity relation in computable linear orderings”. Zbl 1375.03035
Downey, Rodney G.; Lempp, Steffen; Wu, Guohua
1
2017
A survey of results on the d.c.e. and \(n\)-c.e. degrees. Zbl 1325.03046
Lempp, S.
1
2014
The existential theory of the poset of r.e. degrees with a predicate for single jump reducibility. Zbl 0764.03014
Lempp, Steffen; Lerman, Manuel
1
1992
Infinite versions of some problems from finite complexity theory. Zbl 0882.03041
Hirst, Jeffry L.; Lempp, Steffen
1
1996
Lattice embeddings into the r.e. degrees preserving 1. Zbl 0819.03032
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
1
1994
There is no plus-capping degree. Zbl 0806.03031
Downey, Rodney G.; Lempp, Steffen
1
1994
Reductions between types of numberings. Zbl 1439.03077
Herbert, Ian; Jain, Sanjay; Lempp, Steffen; Mustafa, Manat; Stephan, Frank
3
2019
On cototality and the skip operator in the enumeration degrees. Zbl 1457.03059
Andrews, Uri; Ganchev, Hristo A.; Kuyper, Rutger; Lempp, Steffen; Miller, Joseph S.; Soskova, Alexandra A.; Soskova, Mariya I.
3
2019
Theory spectra and classes of theories. Zbl 1423.03146
Andrews, Uri; Cai, Mingzhong; Diamondstone, David; Lempp, Steffen; Miller, Joseph S.
2
2017
Corrigendum to: “The d.r.e. degrees are not dense”. Zbl 1403.03063
Barry Cooper, S.; Harrington, Leo; Lachlan, Alistair H.; Lempp, Steffen; Soare, Robert I.
1
2017
Corrigendum to: “On the complexity of the successivity relation in computable linear orderings”. Zbl 1375.03035
Downey, Rodney G.; Lempp, Steffen; Wu, Guohua
1
2017
Defining totality in the enumeration degrees. Zbl 1402.03061
Cai, Mingzhong; Ganchev, Hristo A.; Lempp, Steffen; Miller, Joseph S.; Soskova, Mariya I.
7
2016
Asymptotic density, computable traceability, and 1-randomness. Zbl 1401.03074
Andrews, Uri; Cai, Mingzhong; Diamondstone, David; Jockusch, Carl; Lempp, Steffen
4
2016
The complements of lower cones of degrees and the degree spectra of structures. Zbl 1370.03060
Andrews, Uri; Cai, Mingzhong; Kalimullin, Iskander Sh.; Lempp, Steffen; Miller, Joseph S.; Montalbán, Antonio
3
2016
The complexity of computable categoricity. Zbl 1345.03063
Downey, Rodney G.; Kach, Asher M.; Lempp, Steffen; Lewis-Pye, Andrew E. M.; Montalbán, Antonio; Turetsky, Daniel D.
23
2015
On the existence of a strong minimal pair. Zbl 1386.03044
Barmpalias, George; Cai, Mingzhong; Lempp, Steffen; Slaman, Theodore A.
3
2015
Computability and uncountable linear orders. I: Computable categoricity. Zbl 1359.03034
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
3
2015
On the structure of the degrees of relative provability. Zbl 1367.03076
Andrews, Uri; Cai, Mingzhong; Diamondstone, David; Lempp, Steffen; Miller, Joseph S.
3
2015
Computability and uncountable linear orders. II: Degree spectra. Zbl 1359.03035
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
2
2015
Universal computably enumerable equivalence relations. Zbl 1338.03076
Andrews, Uri; Lempp, Steffen; Miller, Joseph S.; Ng, Keng Meng; San Mauro, Luca; Sorbi, Andrea
14
2014
Random strings and truth-table degrees of Turing complete c.e. sets. Zbl 1314.03039
Cai, Mingzhong; Downey, Rodney G.; Epstein, Rachel; Lempp, Steffen; Miller, Joseph S.
2
2014
A survey of results on the d.c.e. and \(n\)-c.e. degrees. Zbl 1325.03046
Lempp, S.
1
2014
Computable categoricity versus relative computable categoricity. Zbl 1320.03070
Downey, Rodney G.; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
4
2013
On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics. Zbl 1195.03015
Chong, C. T.; Lempp, Steffen; Yang, Yue
26
2010
On Downey’s conjecture. Zbl 1192.03017
Arslanov, Marat M.; Kalimullin, Iskander Sh.; Lempp, Steffen
11
2010
On the complexity of the successivity relation in computable linear orderings. Zbl 1256.03039
Downey, Rod; Lempp, Steffen; Wu, Guohua
6
2010
Comparing notions of randomness. Zbl 1184.68274
Kastermans, Bart; Lempp, Steffen
4
2010
A decomposition of the Rogers semilattice of a family of d.c.e. sets. Zbl 1185.03071
Badaev, Serikzhan A.; Lempp, Steffen
8
2009
On computable self-embeddings of computable linear orderings. Zbl 1201.03029
Downey, Rodney G.; Kastermans, Bart; Lempp, Steffen
5
2009
Stability and posets. Zbl 1171.03034
Jockusch, Carl G. jun.; Kastermans, Bart; Lempp, Steffen; Lerman, Manuel; Solomon, Reed
3
2009
The strength of some combinatorial principles related to Ramsey’s theorem for pairs. Zbl 1167.03009
Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
10
2008
Subspaces of computable vector spaces. Zbl 1127.03036
Downey, Rodney G.; Hirschfeldt, Denis R.; Kach, Asher M.; Lempp, Steffen; Mileti, Joseph R.; Montalbán, Antonio
13
2007
Ideals in computable rings. Zbl 1127.03037
Downey, Rodney G.; Lempp, Steffen; Mileti, Joseph R.
9
2007
The complexity of the index sets of \(\aleph_0\)-categorical theories and of Ehrenfeucht theories. Zbl 1123.03035
Lempp, Steffen; Slaman, Theodore A.
6
2007
On the computability-theoretic complexity of trivial, strongly minimal models. Zbl 1124.03016
Khoussainov, Bakhadyr M.; Laskowski, Michael C.; Lempp, Steffen; Solomon, Reed
5
2007
Embedding finite lattices into the computably enumerable degrees – a status survey. Zbl 1107.03046
Lempp, Steffen; Lerman, Manuel; Solomon, Reed
4
2006
Filters on computable posets. Zbl 1128.03037
Lempp, Steffen; Mummert, Carl
2
2006
Computable categoricity of trees of finite height. Zbl 1104.03026
Lempp, Steffen; McCoy, Charles; Miller, Russel; Solomon, Reed
16
2005
On extensions of embeddings into the enumeration degrees of the \({\Sigma_2^0}\)-sets. Zbl 1097.03036
Lempp, Steffen; Slaman, Theodore A.; Sorbi, Andrea
5
2005
Computably enumerable algebras, their expansions, and isomorphisms. Zbl 1096.03050
Khoussainov, Bakhadyr; Lempp, Steffen; Slaman, Theodore A.
4
2005
Comparing DNR and WWKL. Zbl 1076.03039
Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
26
2004
The computable dimension of ordered abelian groups. Zbl 1031.03058
Goncharov, Sergey S.; Lempp, Steffen; Solomon, Reed
18
2003
Trivial, strongly minimal theories are model complete after naming constants. Zbl 1035.03013
Goncharov, Sergey S.; Harizanov, Valentina S.; Laskowski, Michael C.; Lempp, Steffen; McCoy, Charles F. D.
11
2003
Computability-theoretic and proof-theoretic aspects of partial and linear orderings. Zbl 1044.03043
Downey, Rodney G.; Hirschfeldt, Denis R.; Lempp, Steffen; Solomon, Reed
9
2003
Friedberg numberings of families of \(n\)-computably enumerable sets. Zbl 1063.03028
Goncharov, S. S.; Lempp, Steffen; Solomon, D. R.
17
2002
The Lindenbaum algebra of the theory of the class of all finite models. Zbl 1033.03035
Lempp, Steffen; Peretyatkin, Mikhail; Solomon, Reed
2
2002
Embedding finite lattices into the \(\Sigma_2^0\) enumeration degrees. Zbl 1021.03035
Lempp, Steffen; Sorbi, Andrea
2
2002
A \(\Delta_2^0\) set with no infinite low subset in either it or its complement. Zbl 0990.03046
Downey, Rod; Hirschfeldt, Denis R.; Lempp, Steffen; Solomon, Reed
16
2001
On the filter of computably enumerable supersets of an r-maximal set. Zbl 1030.03029
Lempp, Steffen; Nies, André; Solomon, D. Reed
2
2001
Differences of computably enumerable sets. Zbl 0964.03043
Lempp, Steffen; Nies, André
3
2000
Constructive models of uncountably categorical theories. Zbl 0932.03036
Herwig, Bernhard; Lempp, Steffen; Ziegler, Martin
6
1999
Recursion theory and complexity. Proceedings of the Kazan ’97 workshop, Kazan, Russia, July 14–19, 1997. Zbl 0923.00014
Arslanov, Marat M.; Lempp, Steffen
2
1999
The proof-theoretic strength of the Dushnik-Miller theorem for countable linear orders. Zbl 0951.03053
Downey, Rodney G.; Lempp, Steffen
2
1999
The \(\Pi_{3}\)-theory of the computably enumerable Turing degrees is undecidable. Zbl 0904.03029
Lempp, Steffen; Nies, André; Slaman, Theodore A.
15
1998
Initial segments of recursive linear orders. Zbl 0909.03034
Ambos-Spies, Klaus; Cooper, S. Barry; Lempp, Steffen
5
1998
Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets. Zbl 0912.03023
Ambos-Spies, Klaus; Lempp, Steffen; Mainhardt, Gunther
2
1998
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Zbl 0883.03025
Lempp, Steffen; Lerman, Manuel
11
1997
Contiguity and distributivity in the enumerable Turing degrees. Zbl 0897.03047
Downey, Rodney G.; Lempp, Steffen
7
1997
The computational complexity of torsion-freeness of finitely presented groups. Zbl 0889.03033
Lempp, Steffen
6
1997
Iterated trees of strategies and priority arguments. Zbl 0899.03030
Lempp, Steffen; Lerman, Manuel
2
1997
On isolating r.e. and isolated d-r.e. degrees. Zbl 0839.03024
Arslanov, Marat M.; Lempp, Steffen; Shore, Richard A.
11
1996
The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations. Zbl 0856.03034
Lempp, Steffen; Lerman, Manuel
5
1996
Interpolating \(d\)-r.e. and REA degrees between r.e. degrees. Zbl 0855.03025
Arslanov, Marat; Lempp, Steffen; Shore, Richard A.
3
1996
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices. Zbl 0863.03021
Ambos-Spies, Klaus; Fejer, Peter A.; Lempp, Steffen; Lerman, Manuel
3
1996
Infinite versions of some problems from finite complexity theory. Zbl 0882.03041
Hirst, Jeffry L.; Lempp, Steffen
1
1996
The undecidability of the \(\Pi_ 4\)-theory for the r.e. wtt and Turing degrees. Zbl 0846.03018
Lempp, Steffen; Nies, André
5
1995
A general framework for priority arguments. Zbl 0841.03025
Lempp, Steffen; Lerman, Manuel
4
1995
Lattice embeddings into the r.e. degrees preserving 0 and 1. Zbl 0808.03027
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
5
1994
Lattice embeddings into the r.e. degrees preserving 1. Zbl 0819.03032
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
1
1994
There is no plus-capping degree. Zbl 0806.03031
Downey, Rodney G.; Lempp, Steffen
1
1994
Highness and bounding minimal pairs. Zbl 0809.03029
Downey, Rodney G.; Lempp, Steffen; Shore, Richard A.
11
1993
The existential theory of the poset of r.e. degrees with a predicate for single jump reducibility. Zbl 0764.03014
Lempp, Steffen; Lerman, Manuel
1
1992
The d.r.e. degrees are not dense. Zbl 0756.03020
Cooper, S. Barry; Harrington, Leo; Lachlan, Alistair H.; Lempp, Steffen; Soare, Robert I.
38
1991
Priority arguments using iterated trees of strategies. Zbl 0702.03019
Lempp, Steffen; Lerman, Manuel
2
1990
Jumps of nontrivial splittings of recursively enumerable sets. Zbl 0687.03021
Ingrassia, Michael A.; Lempp, Steffen
2
1990
Weak density and cupping in the d-r.e. degrees. Zbl 0691.03023
Cooper, S. Barry; Lempp, Steffen; Watson, Philip
25
1989
A limit on relative genericity in the recursively enumerable sets. Zbl 0699.03023
Lempp, Steffen; Slaman, Theodore A.
6
1989
Hyperarithmetical index sets in recursion theory. Zbl 0652.03030
Lempp, Steffen
14
1987
all top 5

Cited by 227 Authors

28 Downey, Rodney Graham
25 Lempp, Steffen
21 Bazhenov, Nikolaĭ Alekseevich
18 Melnikov, Alexander G.
18 Montalbán, Antonio
18 Wu, Guohua
14 Andrews, Uri
14 Kalimullin, Iskander Shagitovich
14 Slaman, Theodore A.
14 Yamaleev, Mars Mansurovich
13 Patey, Ludovic
13 Sorbi, Andrea
12 Shore, Richard A.
10 Arslanov, Marat M.
10 Dzhafarov, Damir D.
10 Jockusch, Carl G. jun.
10 Ng, KengMeng
10 Yang, Yue
9 Hirschfeldt, Denis Roman
9 Li, Angsheng
8 Cenzer, Douglas
8 Greenberg, Noam
8 Harizanov, Valentina S.
8 Kjos-Hanssen, Bjørn
7 Cooper, Stuart Barry
7 Harrison-Trainor, Matthew
7 Miller, Russell G.
7 Mustafa, Manat
7 Ospichev, Sergeĭ Sergeevich
7 Simpson, Stephen G.
7 Solomon, Reed
7 Soskova, Mariya Ivanova
7 Stephan, Frank
6 Badaev, Serikzhan A.
6 Khoussainov, Bakhadyr M.
6 Liu, Jiang
6 Miller, Joseph S.
6 Selivanov, Viktor L’vovich
6 Turetsky, Daniel D.
5 Conidis, Chris J.
5 Fokina, Ekaterina B.
5 Goncharov, Sergeĭ Savost’yanovich
5 Harrington, Leo A.
5 Knight, Julia F.
5 Mileti, Joseph R.
5 Nies, André Otfrid
5 Shafer, Paul
5 Westrick, Linda Brown
4 Ambos-Spies, Klaus
4 Cholak, Peter A.
4 Chong, Chi Tat
4 Lerman, Manuel
4 Morozov, Andreĭ Sergeevich
4 Remmel, Jeffrey B.
3 Barmpalias, George
3 Batyrshin, Ilnur I.
3 Bienvenu, Laurent
3 Brattka, Vasco
3 Brodhead, Paul
3 Cai, Mingzhong
3 Ding, Decheng
3 Dorais, François Gilbert
3 Faĭzrahmanov, Marat Khaidarovich
3 Hirst, Jeffry Lynn
3 Jahn, Michael A.
3 Kach, Asher M.
3 Kalmurzaev, Birzhan S.
3 Laskowski, Michael Chris
3 San Mauro, Luca
3 Shlapentokh, Alexandra
3 Terwijn, Sebastiaan A.
3 Yu, Liang
2 Beros, Achilles A.
2 Bikmukhametov, R. I.
2 Binns, Stephen
2 Buss, Sam
2 Calvert, Wesley
2 Carlucci, Lorenzo
2 Chubb, Jennifer
2 Cole, Joshua A.
2 Dimitrov, Rumen D.
2 Faizrakhmanov, Marat Kh.
2 Fang, Chengling
2 Flood, Stephen P.
2 Frittaion, Emanuele
2 Frolov, Andrey N.
2 Ganchev, Hristo A.
2 Groszek, Marcia J.
2 Hendtlass, Matthew Ralph John
2 Hudelson, W. M. Phillip
2 Igusa, Gregory
2 Jain, Sanjay
2 Kent, Thomas F.
2 Khan, Mushfeq
2 Kihara, Takayuki
2 Kreuzer, Alexander P.
2 Kudinov, Oleg Victorovich
2 Kuyper, Rutger
2 Lachlan, Alistair H.
2 LaForte, Geoffrey L.
...and 127 more Authors
all top 5

Cited in 42 Serials

63 Annals of Pure and Applied Logic
45 The Journal of Symbolic Logic
31 Archive for Mathematical Logic
23 Algebra and Logic
22 The Bulletin of Symbolic Logic
15 Transactions of the American Mathematical Society
15 Journal of Mathematical Logic
11 Notre Dame Journal of Formal Logic
10 Advances in Mathematics
10 Lobachevskii Journal of Mathematics
9 Proceedings of the American Mathematical Society
8 Theoretical Computer Science
7 Journal of Algebra
7 Russian Mathematics
7 Journal of Mathematical Sciences (New York)
6 Siberian Mathematical Journal
6 Mathematical Logic Quarterly (MLQ)
5 Israel Journal of Mathematics
4 Computability
3 Studia Logica
3 International Journal of Algebra and Computation
3 MSCS. Mathematical Structures in Computer Science
2 Journal of Computer and System Sciences
2 Doklady Mathematics
2 Theory of Computing Systems
2 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Tohoku Mathematical Journal. Second Series
1 Order
1 Information and Computation
1 Journal of the American Mathematical Society
1 Science in China. Series A
1 Bulletin of the American Mathematical Society. New Series
1 Journal of Knot Theory and its Ramifications
1 Annals of Mathematics and Artificial Intelligence
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Acta Mathematica Sinica. English Series
1 Journal of the Australian Mathematical Society
1 Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika
1 Oberwolfach Reports
1 Proceedings of the Steklov Institute of Mathematics
1 Forum of Mathematics, Sigma
1 European Journal of Mathematics

Citations by Year