41 found
Sort by:
Disambiguations:
Manuel Lerman [25]M. Lerman [17]Mannel Lerman [1]
  1.  98 DLs
    Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman & Reed Solomon (2006). On a Conjecture of Dobrinen and Simpson Concerning Almost Everywhere Domination. Journal of Symbolic Logic 71 (1):119 - 136.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2.  47 DLs
    Carl Jockusch Jr, Bart Kastermans, Steffen Lempp, Manuel Lerman & Reed Solomon (2009). Stability and Posets. 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)  
     
    My bibliography  
     
    Export citation  
  3.  32 DLs
    Manuel Lerman (1971). Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets. Journal of Symbolic Logic 36 (2):193-215.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4.  10 DLs
    Manuel Lerman (1970). Turing Degrees and Many-One Degrees of Maximal Sets. Journal of Symbolic Logic 35 (1):29-40.
  5.  9 DLs
    Manuel Lerman (1974). Least Upper Bounds for Minimal Pairs of |Alpha-R.E. |Alpha Degrees. Journal of Symbolic Logic 39 (1):49 - 56.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6.  9 DLs
    C. G. Jockusch Jr, M. Lerman, R. I. Soare & R. M. Solovay (1989). Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. Journal of Symbolic Logic 54 (4):1288 - 1323.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7.  8 DLs
    Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman (1996). Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. 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 (8 more)  
     
    My bibliography  
     
    Export citation  
  8.  8 DLs
    M. Lerman (2010). A Framework for Priority Arguments. Cambridge University Press.
    This book presents a unifying framework for using priority arguments to prove theorems in computability.
    Direct download  
     
    My bibliography  
     
    Export citation  
  9.  7 DLs
    K. Ambos-Spies & M. Lerman (1986). Lattice Embeddings Into the Recursively Enumerable Degrees. Journal of Symbolic Logic 51 (2):257-272.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  10.  7 DLs
    Steffen Lempp & Manuel Lerman (1992). The Existential Theory of the Poset of R.E. Degrees with a Predicate for Single Jump Reducibility. 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 (6 more)  
     
    My bibliography  
     
    Export citation  
  11.  7 DLs
    Manuel Lerman & James H. Schmerl (1979). Theories with Recursive Models. Journal of Symbolic Logic 44 (1):59-76.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12.  6 DLs
    K. Ambos-Spies & M. Lerman (1989). Lattice Embeddings Into the Recursively Enumerable Degrees. II. Journal of Symbolic Logic 54 (3):735-760.
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  13.  6 DLs
    Manuel Lerman (1969). Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. Journal of Symbolic Logic 34 (1):85-98.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  14.  4 DLs
    William C. Calhoun & Manuel Lerman (2001). Embedding Finite Lattices Into the Ideals of Computably Enumerable Turing Degrees. 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 (6 more)  
     
    My bibliography  
     
    Export citation  
  15.  4 DLs
    Manuel Lerman (1973). Admissible Ordinals and Priority Arguments. In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,Springer-Verlag 311--344.
    Direct download  
     
    My bibliography  
     
    Export citation  
  16.  4 DLs
    Manuel Lerman (1976). Types of Simple Α-Recursively Enumerable Sets. Journal of Symbolic Logic 41 (2):419-426.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  17.  3 DLs
    M. Lerman & J. B. Remmel (1984). The Universal Splitting Property. II. Journal of Symbolic Logic 49 (1):137-150.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18.  2 DLs
    Sc Kleene, El Post, M. Kline, M. Lerman, L. Lowenheim, D. Normann, P. Odifreddi, G. Peano, Cs Peirce & R. Penrose (1999). R. PETER [1934] Uber den Zussammenhang der verschiedenen Begriffe der rekursiven Funktion, Math. Ann. In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier 34.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  19.  2 DLs
    Manuel Lerman (1976). Congruence Relations, Filters, Ideals, and Definability in Lattices of Α-Recursively Enumerable Sets. Journal of Symbolic Logic 41 (2):405-418.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  20.  2 DLs
    M. Lerman (1983). Degrees of Unsolvability: Local and Global Theory. Springer-Verlag.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  21.  2 DLs
    Steffen Lempp & Manuel Lerman (1995). A General Framework for Priority Arguments. Bulletin of Symbolic Logic 1 (2):189-201.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  22.  1 DLs
    Manuel Lerman & Richard Watnick (2003). Computable Choice Functions for Computable Linear Orderings. 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)  
     
    My bibliography  
     
    Export citation  
  23.  1 DLs
    M. Lerman (1985). Upper Bounds for the Arithmetical Degrees. Annals of Pure and Applied Logic 29 (3):225-254.
  24.  1 DLs
    Mannel Lerman (1978). On Elementary Theories of Some Lattices or Α-Recursively Enumerable Sets. Annals of Mathematical Logic 14 (3):227-272.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25.  1 DLs
    M. Lerman (1985). [Omnibus Review]. Journal of Symbolic Logic 50 (2):550-552.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26.  1 DLs
    Steffen Lempp & Manuel Lerman (1997). A Finite Lattice Without Critical Triple That Cannot Be Embedded Into the Enumerable Turing Degrees. 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 (3 more)  
     
    My bibliography  
     
    Export citation  
  27.  1 DLs
    Steffen Lempp & Manuel Lerman (1997). Iterated Trees of Strategies and Priority Arguments. Archive for Mathematical Logic 36 (4-5):297-312.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  28.  1 DLs
    Burkhard Englert, Manuel Lerman & Kevin Wald (2003). Homomorphisms and Quotients of Degree Structures. 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 (3 more)  
     
    My bibliography  
     
    Export citation  
  29.  1 DLs
    M. Lerman (2000). A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices Into the Computably Enumerable Degrees. 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 (3 more)  
     
    My bibliography  
     
    Export citation  
  30.  1 DLs
    C. T. Chong & M. Lerman (1976). Hyperhypersimple α-r.e. sets. Annals of Mathematical Logic 9 (1-2):1-48.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  31.  0 DLs
    Manuel Lerman (1991). Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets. Mathematical Logic Quarterly 37 (19‐22):331-342.
  32.  0 DLs
    Manuel Lerman, Reed Solomon & Henry Towsner (2013). Separating Principles Below Ramsey's Theorem for Pairs. Journal of Mathematical Logic 13 (2):1350007.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33.  0 DLs
    L. Harrington, R. I. Soare, J. F. Knight & M. Lerman (1998). Griffor, ER, See Rathjen, M. Annals of Pure and Applied Logic 94:297.
    No categories
     
    My bibliography  
     
    Export citation  
  34.  0 DLs
    Manuel Lerman (1986). Degrees Which Do Not Bound Minimal Degrees. Annals of Pure and Applied Logic 30 (3):249-276.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  35.  0 DLs
    M. Lerman (1998). A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices Into the Computably Enumerable Degrees. 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 (3 more)  
     
    My bibliography  
     
    Export citation  
  36.  0 DLs
    M. Lerman, J. H. Schmerl & R. I. Soare (eds.) (1981). Logic Year 1979-80, the University of Connecticut, Usa. Springer-Verlag.
     
    My bibliography  
     
    Export citation  
  37.  0 DLs
    Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl & Reed Solomon (2008). Self-Embeddings of Computable Trees. 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)  
     
    My bibliography  
     
    Export citation  
  38.  0 DLs
    Manuel Lerman (1972). On Suborderings of the Α-Recursively Enumerable Α-Degrees. Annals of Mathematical Logic 4 (4):369-392.
  39.  0 DLs
    Manuel Lerman (1976). Ideals of Generalized Finite Sets in Lattices of Α‐Recursively Enumerable Sets. Mathematical Logic Quarterly 22 (1):347-352.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  40.  0 DLs
    Manuel Lerman & Gerald E. Sacks (1972). Some Minimal Pairs of Α-Recursively Enumerable Degrees. Annals of Mathematical Logic 4 (4):415-442.