21 found
Sort by:
Disambiguations:
Klaus Ambos-Spies [18]K. Ambos-Spies [3]
  1. Klaus Ambos-Spies, Joan Bagaria, Enrique Casanovas & Ulrich Kohlenbach (2013). Preface. Annals of Pure and Applied Logic 164 (12):1177.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Klaus Ambos-Spies, Philipp Bodewig, Yun Fan & Thorsten Kräling (2013). The Partial Orderings of the Computably Enumerable ibT-Degrees and Cl-Degrees Are Not Elementarily Equivalent. Annals of Pure and Applied Logic 164 (5):577-588.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe (2012). Computability in Europe 2009. Annals of Pure and Applied Logic 163 (5):483-484.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu (2009). Bounding Non- GL ₂ and R.E.A. Journal of Symbolic Logic 74 (3):989-1000.
    We prove that every Turing degree a bounding some non-GL₂ degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Klaus Ambos-Spies, Bj�Rn Kjos-Hanssen, Steffen Lempp & Theodore A. Slaman (2004). Comparing DNR and WWKL. Journal of Symbolic Logic 69 (4):1089 - 1104.
    In Reverse Mathematics, the axiom system DNR, asserting the existence of diagonally nonrecursive functions, is strictly weaker than WWKL₀ (weak weak König's Lemma).
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Klaus Ambos-Spies & Peter A. Fejer (2001). Embeddings of and the Contiguous Degrees. Annals of Pure and Applied Logic 112 (2-3):151-188.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Klaus Ambos-Spies, Denis R. Hirschfeldt & Richard A. Shore (2000). Undecidability and 1-Types in Intervals of the Computably Enumerable Degrees. Annals of Pure and Applied Logic 106 (1-3):1-47.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Klaus Ambos-Spies, Marat Arslanov, Douglas Cenzer, Peter Cholak, Chi Tat Chong, Decheng Ding, Rod Downey, Peter A. Fejer, Sergei S. Goncharov & Edward R. Griffor (1998). Participants and Titles of Lectures. Annals of Pure and Applied Logic 94:3-6.
    No categories
     
    My bibliography  
     
    Export citation  
  9. Klaus Ambos-Spies, Theodore A. Slaman & Robert I. Soare (1998). Preface. Annals of Pure and Applied Logic 94 (1-3):1.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. 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  
  11. Z. Adamowicz, K. Ambos-Spies, A. H. Lachlan, R. I. Soare, R. A. Shore, M. A. da ArchangelskyTaitslin, S. Artemov & J. Bagaria (1994). Master Index to Volumes 61-70. Annals of Pure and Applied Logic 70:289-294.
     
    My bibliography  
     
    Export citation  
  12. Klaus Ambos-Spies, Alistair H. Lachlan & Robert I. Soare (1993). The Continuity of Cupping to 0'. Annals of Pure and Applied Logic 64 (3):195-209.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Klaus Ambos-Spies & Richard A. Shore (1993). Undecidability and 1-Types in the Recursively Enumerable Degrees. Annals of Pure and Applied Logic 63 (1):3-37.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. Klaus Ambos-Spies & André Nies (1992). Cappable Recursively Enumerable Degrees and Post's Program. Archive for Mathematical Logic 32 (1):51-56.
    We give a simple structural property which characterizes the r.e. sets whose (Turing) degrees are cappable. Since cappable degrees are incomplete, this may be viewed as a solution of Post's program, which asks for a simple structural property of nonrecursive r.e. sets which ensures incompleteness.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Klaus Ambos-Spies, André Nies & Richard A. Shore (1992). The Theory of the Recursively Enumerable Weak Truth-Table Degrees is Undecidable. Journal of Symbolic Logic 57 (3):864-874.
    We show that the partial order of Σ0 3-sets under inclusion is elementarily definable with parameters in the semilattice of r.e. wtt-degrees. Using a result of E. Herrmann, we can deduce that this semilattice has an undecidable theory, thereby solving an open problem of P. Odifreddi.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. 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  
  17. Klaus Ambos-Spies & Robert I. Soare (1989). The Recursively Enumerable Degrees Have Infinitely Many One-Types. Annals of Pure and Applied Logic 44 (1-2):1-23.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. Klaus Ambos-Spies & Peter A. Fejer (1988). Degree Theoretical Splitting Properties of Recursively Enumerable Sets. Journal of Symbolic Logic 53 (4):1110-1137.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  19. 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  
  20. Klaus Ambos-Spies (1985). Cupping and Noncapping in the Re Weak Truth Table and Turing Degrees. Archive for Mathematical Logic 25 (1):109-126.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  21. Klaus Ambos-Spies (1984). An Extension of the Nondiamond Theorem in Classical and Α-Recursion Theory. Journal of Symbolic Logic 49 (2):586-607.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation