The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Steffen Lempp: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt
    Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:465-473 [Conf]
  2. Marat M. Arslanov, Steffen Lempp, Richard A. Shore
    Interpolating d-r.e. and REA Degrees between r.e. Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:29-56 [Journal]
  3. S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
    The d.r.e. Degrees are Not Dense. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:55, n:2, pp:125-151 [Journal]
  4. Steffen Lempp, Manuel Lerman
    A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:87, n:2, pp:167-185 [Journal]
  5. Steffen Lempp, Yuefei Sui
    An Extended Lachlan Splitting Theorem. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:79, n:1, pp:53-59 [Journal]
  6. Steffen Lempp, Manuel Lerman
    A general framework for priority arguments. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1995, v:1, n:2, pp:189-201 [Journal]
  7. Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman
    Computably Enumerable Algebras, Their Expansions, and Isomorphisms. [Citation Graph (0, 0)][DBLP]
    IJAC, 2005, v:15, n:3, pp:437-454 [Journal]
  8. 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. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:3, pp:880-905 [Journal]
  9. Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon
    A delta02 Set with No Infinite Low Subset in Either It or Its Complement. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:3, pp:1371-1381 [Journal]
  10. Rodney G. Downey, Steffen Lempp
    Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:4, pp:1579-1580 [Journal]
  11. Rodney G. Downey, Steffen Lempp
    Contiguity and Distributivity in the Enumerable Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:4, pp:1215-1240 [Journal]
  12. Rodney G. Downey, Geoffrey LaForte, Steffen Lempp
    A Delta02 Set With Barely Sigma02 Degree. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1700-1718 [Journal]
  13. Steffen Lempp
    A High Strongly Noncappable Degree. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:1, pp:174-187 [Journal]
  14. Steffen Lempp, Manuel Lerman
    The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:3, pp:1120-1130 [Journal]
  15. Steffen Lempp, André Nies
    The Undecidability of the Pi4-Theory for the R. E. WTT and Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:4, pp:1118-1136 [Journal]
  16. Steffen Lempp, Andrea Sorbi
    Embedding Finite Lattices into the Sigma02 Enumeration Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:69-90 [Journal]
  17. Steffen Lempp, Theodore A. Slaman
    A Limit on Relative Genericity in the Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:376-395 [Journal]
  18. Steffen Lempp, Rodney G. Downey, Richard A. Shore
    Highness and Bounding Minimal Pairs. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:475-491 [Journal]
  19. Steffen Lempp, André Nies
    Differences of Computably Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:555-561 [Journal]
  20. Rich Blaylock, Rodney G. Downey, Steffen Lempp
    Infima in the Recursively Enumerable Weak Truth Table Degrees. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1997, v:38, n:3, pp:406-418 [Journal]
  21. Jeffry L. Hirst, Steffen Lempp
    Infinite Versions of Some Problems From Finite Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1996, v:37, n:4, pp:545-553 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    Order, 2002, v:19, n:4, pp:343-364 [Journal]

  23. On the filter of computably enumerable supersets of an r-maximal set. [Citation Graph (, )][DBLP]


  24. Iterated trees of strategies and priority arguments. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002