Steffen Lempp

	2010
32		Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp: On Downey's conjecture. J. Symb. Log. 75(2): 401-441 (2010)
31		Bart Kastermans, Steffen Lempp: Comparing notions of randomness. Theor. Comput. Sci. 411(3): 602-616 (2010)
	2009
30		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)
29		Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon: Stability and posets. J. Symb. Log. 74(2): 693-711 (2009)
28		Rodney G. Downey, Bart Kastermans, Steffen Lempp: On computable self-embeddings of computable linear orderings. J. Symb. Log. 74(4): 1352-1366 (2009)
	2006
27		Steffen Lempp, Carl Mummert: Filters on Computable Posets. Notre Dame Journal of Formal Logic 47(4): 479-485 (2006)
	2005
26		Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman: Computably Enumerable Algebras, Their Expansions, and Isomorphisms. IJAC 15(3): 437-454 (2005)
25		Steffen Lempp, Charles F. D. McCoy, Russell Miller, Reed Solomon: Computable categoricity of trees of finite height. J. Symb. Log. 70(1): 151-215 (2005)
	2004
24		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
23		Steffen Lempp, Andrea Sorbi: Embedding Finite Lattices into the Sigma02 Enumeration Degrees. J. Symb. Log. 67(1): 69-90 (2002)
22		Rodney G. Downey, Steffen Lempp: Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. J. Symb. Log. 67(4): 1579-1580 (2002)
21		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
20		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)
19		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
18		Steffen Lempp, André Nies: Differences of Computably Enumerable Sets. Math. Log. Q. 46(4): 555-561 (2000)
	1999
17		Rodney G. Downey, Geoffrey LaForte, Steffen Lempp: A Delta02 Set With Barely Sigma02 Degree. J. Symb. Log. 64(4): 1700-1718 (1999)
	1998
16		Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt: Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. MFCS 1998: 465-473
	1997
15		Steffen Lempp, Manuel Lerman: A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. Ann. Pure Appl. Logic 87(2): 167-185 (1997)
14		Steffen Lempp, Manuel Lerman: Iterated trees of strategies and priority arguments. Arch. Math. Log. 36(4-5): 297-312 (1997)
13		Rodney G. Downey, Steffen Lempp: Contiguity and Distributivity in the Enumerable Turing Degrees. J. Symb. Log. 62(4): 1215-1240 (1997)
12		Rich Blaylock, Rodney G. Downey, Steffen Lempp: Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame Journal of Formal Logic 38(3): 406-418 (1997)
	1996
11		Marat M. Arslanov, Steffen Lempp, Richard A. Shore: Interpolating d-r.e. and REA Degrees between r.e. Degrees. Ann. Pure Appl. Logic 78(1-3): 29-56 (1996)
10		Steffen Lempp, Yuefei Sui: An Extended Lachlan Splitting Theorem. Ann. Pure Appl. Logic 79(1): 53-59 (1996)
9		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)
8		Jeffry L. Hirst, Steffen Lempp: Infinite Versions of Some Problems From Finite Complexity Theory. Notre Dame Journal of Formal Logic 37(4): 545-553 (1996)
	1995
7		Steffen Lempp, Manuel Lerman: A general framework for priority arguments. Bulletin of Symbolic Logic 1(2): 189-201 (1995)
6		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)
	1993
5		Steffen Lempp, Rodney G. Downey, Richard A. Shore: Highness and Bounding Minimal Pairs. Math. Log. Q. 39: 475-491 (1993)
	1992
4		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
3		S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare: The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Logic 55(2): 125-151 (1991)
	1989
2		Steffen Lempp, Theodore A. Slaman: A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. 54(2): 376-395 (1989)
	1988
1		Steffen Lempp: A High Strongly Noncappable Degree. J. Symb. Log. 53(1): 174-187 (1988)

Coauthor Index

1	Klaus Ambos-Spies	[9] [16] [24]
2	Marat M. Arslanov	[11] [32]
3	Serikzhan A. Badaev	[30]
4	Rich Blaylock	[12]
5	S. Barry Cooper	[3]
6	Rodney G. Downey (Rod Downey)	[5] [12] [13] [17] [19] [22] [28]
7	Peter A. Fejer	[9]
8	Leo Harrington	[3]
9	Denis R. Hirschfeldt	[19]
10	Jeffry L. Hirst	[8]
11	Carl G. Jockusch Jr.	[29]
12	Iskander Sh. Kalimullin	[32]
13	Bart Kastermans	[28] [29] [31]
14	Bakhadyr Khoussainov	[26]
15	Bjørn Kjos-Hanssen	[24]
16	Geoffrey LaForte	[17]
17	Alistair H. Lachlan	[3]
18	Manuel Lerman	[4] [7] [9] [14] [15] [29]
19	Gunther Mainhardt	[16]
20	Charles F. D. McCoy	[21] [25]
21	Russell Miller	[25]
22	Andrei S. Morozov	[21]
23	Carl Mummert	[27]
24	André Nies	[6] [18] [20]
25	Richard A. Shore	[5] [11]
26	Theodore A. Slaman	[2] [24] [26]
27	Robert I. Soare	[3]
28	Reed Solomon	[19] [20] [21] [25] [29]
29	Andrea Sorbi	[23]
30	Yuefei Sui	[10]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page