The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Manuel Lerman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Burkhard Englert, Manuel Lerman, Kevin Wald
    Homomorphisms and quotients of degree structures. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:123, n:1-3, pp:193-233 [Journal]
  2. 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]
  3. Manuel Lerman
    A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:101, n:2-3, pp:275-297 [Journal]
  4. Manuel Lerman
    A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:143-180 [Journal]
  5. 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]
  6. 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]
  7. Klaus Ambos-Spies, Manuel Lerman
    Lattice Embeddings into the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:2, pp:257-272 [Journal]
  8. Klaus Ambos-Spies, Manuel Lerman
    Lattice Embeddings into the Recursively Enumerable Degrees II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:735-760 [Journal]
  9. William C. Calhoun, Manuel Lerman
    Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:4, pp:1791-1802 [Journal]
  10. Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay
    Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:4, pp:1288-1323 [Journal]
  11. 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]
  12. Manuel Lerman
    Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1969, v:34, n:1, pp:85-98 [Journal]
  13. Manuel Lerman
    Turing Degrees and Many-One Degrees of Maximal Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1970, v:35, n:1, pp:29-40 [Journal]
  14. Manuel Lerman
    Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1971, v:36, n:2, pp:193-215 [Journal]
  15. Manuel Lerman
    Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:1, pp:49-56 [Journal]
  16. Manuel Lerman
    Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:2, pp:405-418 [Journal]
  17. Manuel Lerman
    Types of Simple alpha-Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:2, pp:419-426 [Journal]
  18. Manuel Lerman, Jeffrey B. Remmel
    The Universal Splitting Property. II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:1, pp:137-150 [Journal]
  19. Manuel Lerman, James H. Schmerl
    Theories with Recursive Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:1, pp:59-76 [Journal]
  20. Manuel Lerman, Richard Watnick
    Computable choice functions for computable linear orderings. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:5, pp:485-510 [Journal]

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


Search in 0.003secs, Finished in 0.004secs
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