Order:
Disambiguations
Manuel Lerman [31]M. Lerman [17]Mannel Lerman [1]
  1.  4
    Separating Principles Below Ramsey's Theorem for Pairs.Manuel Lerman, Reed Solomon & Henry Towsner - 2013 - Journal of Mathematical Logic 13 (2):1350007.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  2. On a Conjecture of Dobrinen and Simpson Concerning Almost Everywhere Domination.Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman & Reed Solomon - 2006 - Journal of Symbolic Logic 71 (1):119 - 136.
  3.  5
    Degrees of Unsolvability: Local and Global Theory.M. Lerman - 1983 - Springer Verlag.
  4.  13
    Carl G. JockuschJr., and David B. Posner. Double Jumps of Minimal Degrees. The Journal of Symbolic Logic, Vol. 43 No. 4 , Pp. 715–724. - Carl G. JockuschJr., and David B. Posner. Automorphism Bases for Degrees of Unsotvability. Israel Journal of Mathematics, Vol. 40 , Pp. 150–164. - Richard L. Epstein. Initial Segments of Degrees Below 0′. Memoirs of the American Mathematical Society, No. 241. American Mathematical Society, Providence1981, Vi + 102 Pp. - Richard A. Shore. The Theory of the Degrees Below 0′. The Journal of the London Mathematical Society, Ser. 2 Vol. 24 , Pp. 1–14.M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
  5. Stability and Posets.Carl Jockusch Jr, Bart Kastermans, Steffen Lempp, Manuel Lerman & Reed Solomon - 2009 - Journal of Symbolic Logic 74 (2):693 - 711.
    Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite $\Pi _1^0 $ chains and antichains, in infinite computable stable and weakly stable posets. For example, we extend a result of Hirschfeldt and Shore to show that every infinite computable weakly stable poset contains either an infinite low chain or an infinite computable (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  14
    A Finite Lattice Without Critical Triple That Cannot Be Embedded Into the Enumerable Turing Degrees.Steffen Lempp & Manuel Lerman - 1997 - Annals of Pure and Applied Logic 87 (2):167-185.
    We exhibit a finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Our method promises to lead to a full characterization of the finite lattices embeddable into the enumerable Turing degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  7.  11
    A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices Into the Computably Enumerable Degrees.M. Lerman - 1998 - Annals of Pure and Applied Logic 94 (1-3):143-180.
    We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  8.  4
    Degrees Which Do Not Bound Minimal Degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
  9.  7
    A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices Into the Computably Enumerable Degrees.M. Lerman - 2000 - Annals of Pure and Applied Logic 101 (2-3):275-297.
    We present a necessary and sufficient condition for the embeddability of a principally decomposable finite lattice into the computably enumerable degrees. This improves a previous result which required that, in addition, the lattice be ranked. The same condition is also necessary and sufficient for a finite lattice to be embeddable below every non-zero computably enumerable degree.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  10.  17
    Lattice Embeddings Into the Recursively Enumerable Degrees.K. Ambos-Spies & M. Lerman - 1986 - Journal of Symbolic Logic 51 (2):257-272.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  11.  11
    Lattice Embeddings Into the Recursively Enumerable Degrees. II.K. Ambos-Spies & M. Lerman - 1989 - Journal of Symbolic Logic 54 (3):735-760.
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  12.  2
    [Omnibus Review].M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
  13.  24
    Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.C. G. Jockusch, M. Lerman, R. I. Soare & R. M. Solovay - 1989 - Journal of Symbolic Logic 54 (4):1288-1323.
  14.  13
    Upper Bounds for the Arithmetical Degrees.M. Lerman - 1983 - Annals of Pure and Applied Logic 29 (3):225-254.
  15.  45
    A General Framework for Priority Arguments.Steffen Lempp & Manuel Lerman - 1995 - Bulletin of Symbolic Logic 1 (2):189-201.
  16.  7
    The Universal Splitting Property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.
  17. Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.
  18.  4
    Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
    No categories
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   6 citations  
  19.  18
    Self-Embeddings of Computable Trees.Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl & Reed Solomon - 2008 - Notre Dame Journal of Formal Logic 49 (1):1-37.
    We divide the class of infinite computable trees into three types. For the first and second types, 0' computes a nontrivial self-embedding while for the third type 0'' computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite Π01 antichain. This result is optimal and has connections (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  9
    Admissible Ordinals and Priority Arguments.Manuel Lerman - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 311--344.
  21.  28
    The Existential Theory of the Poset of R.E. Degrees with a Predicate for Single Jump Reducibility.Steffen Lempp & Manuel Lerman - 1992 - Journal of Symbolic Logic 57 (3):1120-1130.
    We show the decidability of the existential theory of the recursively enumerable degrees in the language of Turing reducibility, Turing reducibility of the Turing jumps, and least and greatest element.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  29
    Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
    We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursively enumerable sets. The key to this decision procedure is a characterization of the finite lattices which can be embedded into the r.e. wtt-degrees by a map which preserves the least and greatest elements: a finite lattice has such an embedding if and only if it is distributive and the ideal generated by its cappable elements and the filter generated by its cuppable elements are (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  23.  18
    Ideals of Generalized Finite Sets in Lattices of Α-Recursively Enumerable Sets.Manuel Lerman - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):347-352.
  24.  16
    Theories with Recursive Models.Manuel Lerman & James H. Schmerl - 1979 - Journal of Symbolic Logic 44 (1):59-76.
  25.  32
    Iterated Trees of Strategies and Priority Arguments.Steffen Lempp & Manuel Lerman - 1997 - Archive for Mathematical Logic 36 (4-5):297-312.
  26.  10
    Types of Simple Α-Recursively Enumerable Sets.Manuel Lerman - 1976 - Journal of Symbolic Logic 41 (2):419-426.
  27.  5
    R. PETER [1934] Uber den Zussammenhang der verschiedenen Begriffe der rekursiven Funktion, Math. Ann.Sc Kleene, El Post, M. Kline, M. Lerman, L. Lowenheim, D. Normann, P. Odifreddi, G. Peano, Cs Peirce & R. Penrose - 1999 - In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. pp. 34.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  28.  4
    Ideals of Generalized Finite Sets in Lattices of Α‐Recursively Enumerable Sets.Manuel Lerman - 1976 - Mathematical Logic Quarterly 22 (1):347-352.
  29.  19
    Least Upper Bounds for Minimal Pairs of Α-R.E. Α-Degrees.Manuel Lerman - 1974 - Journal of Symbolic Logic 39 (1):49-56.
  30.  20
    Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):331-342.
  31.  10
    Congruence Relations, Filters, Ideals, and Definability in Lattices of Α-Recursively Enumerable Sets.Manuel Lerman - 1976 - Journal of Symbolic Logic 41 (2):405-418.
  32.  12
    Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability.Manuel Lerman - 1969 - Journal of Symbolic Logic 34 (1):85-98.
  33.  20
    Turing Degrees and Many-One Degrees of Maximal Sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.
  34.  11
    Computable Choice Functions for Computable Linear Orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
    A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order-types for which each computable model has a computable choice set, and a full characterization in the relativized case; Every model of the linear order-type α of degree ≤ d has a choice set of degree ≤ d iff α can written as a finite sum of order-types, each of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  11
    Embedding Finite Lattices Into the Ideals of Computably Enumerable Turing Degrees.William C. Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
    We show that the lattice L 20 is not embeddable into the lattice of ideals of computably enumerable Turing degrees (J). We define a structure called a pseudolattice that generalizes the notion of a lattice, and show that there is a Π 2 necessary and sufficient condition for embedding a finite pseudolattice into J.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  36.  5
    Homomorphisms and Quotients of Degree Structures.Burkhard Englert, Manuel Lerman & Kevin Wald - 2003 - Annals of Pure and Applied Logic 123 (1-3):193-233.
    We investigate homomorphisms of degree structures with various relations, functions and constants. Our main emphasis is on pseudolattices, i.e., partially ordered sets with a join operation and relations simulating the meet operation. We show that there are no finite quotients of the pseudolattice of degrees or of the pseudolattice of degrees 0′, but that many finite distributive lattices are pseudolattice quotients of the pseudolattice of computably enumerable degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  3
    Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
  38. Griffor, ER, See Rathjen, M.L. Harrington, R. I. Soare, J. F. Knight & M. Lerman - 1998 - Annals of Pure and Applied Logic 94:297.
    No categories
     
    Export citation  
     
    Bookmark  
  39.  13
    A Framework for Priority Arguments.M. Lerman - 2010 - Cambridge University Press.
    This book presents a unifying framework for using priority arguments to prove theorems in computability.
    Direct download  
     
    Export citation  
     
    Bookmark  
  40. Logic Year 1979-80, the University of Connecticut, Usa.M. Lerman, J. H. Schmerl & R. I. Soare (eds.) - 1981 - Springer Verlag.