On degrees of recursive unsolvability

DOI10.2307/1969604MaRDI QIDQ768100zbMATHOpenAlexFDO

Authors Clifford Spector

Publication date 1956

Published in Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1969604

zbMATH Keywords

Philosophy and Foundations of Mathematics

Cited in

(85)

• Direct construction of Scott ideals
• Low level nondefinability results: domination and recursive enumeration
• On initial segments of hyperdegrees
• Lowness, Randomness, and Computable Analysis
• An application of Σ₄⁰ determinacy to the degrees of unsolvability
• 2000 Annual Meeting of the Association for Symbolic Logic
• Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit
• Systems of notations and the ramified analytical hierarchy
• Hyperarithmetical Sets
• On the notational independence of various hierarchies of degrees of unsolvability
• Minimal α-recursion theoretic degrees
• The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable
• Lattice initial segments of the hyperdegrees
• On a problem of Cooper and Epstein
• A cornucopia of minimal degrees
• Weakly represented families in reverse mathematics
• On the upper semi-lattice of -degrees
• Honest polynomial time reducibilities and the \(P=?NP\) problem
• Scaling in the animal kingdom
• Jumps of quasi-minimal enumeration degrees
• La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
• Decomposition and infima in the computably enumerable degrees
• Complementation in the Turing degrees
• Minimal degrees and the jump operator
• The Turing closure of an Archimedean field
• On minimal pairs of enumeration degrees
• Empty intervals in the enumeration degrees
• Degrees bounding minimal degrees
• An oracle builder's toolkit
• Local Initial Segments of The Turing Degrees
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
• A note on the hyperarithmetical hierarchy
• Classes of Polish spaces under effective Borel isomorphism
• Minimal weak truth table degrees and computably enumerable Turing degrees
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• Countable admissible ordinals and hyperdegrees
• Degree Structures: Local and Global Investigations
• A survey of partial degrees
• Upper bounds for the arithmetical degrees
• A single minimal complement for the c.e. degrees
• Some nondistributive lattices as initial segments of the degrees of unsolvability
• Cohen and Set Theory
• Generic degrees are complemented
• Closed choice and a uniform low basis theorem
• Degrees of unsolvability of continuous functions
• Structures of some strong reducibilities
• Undecidability and initial segments of the (r.e.) tt-degrees
• On the theory of the PTIME degrees of the recursive sets
• Quasi-minimal enumeration degrees and minimal Turing degrees
• Computing degrees of unsolvability
• Minimal Covers and Arithmetical Sets
• The theory of the \(\alpha \) degrees is undecidable
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Recursively enumerable sets and degrees
• Degrees of transducibility
• Lower bounds on degrees of game-theoretic structures
• Honest polynomial degrees and \(P=?NP\)
• Measure and cupping in the Turing degrees
• Transducer degrees: atoms, infima and suprema
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Hierarchies in Recursive Function Theory
• A Galois connection between Turing jumps and limits
• Initial segments of the degrees of size \(\aleph _ 1\)
• Arithmetical Sacks forcing
• On the strength of Ramsey's theorem for pairs
• On trees without hyperimmune branches
• Noninitial segments of the α-degrees
• The minimal e-degree problem in fragments of Peano arithmetic
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Measure-theoretic construction of incomparable hyperdegrees
• The Mathematical Work of S.C.Kleene
• A minimal degree less than 0’
• Genericity for Mathias forcing over general Turing ideals
• Minimal Covers and Hyperdegrees
• Automorphism bases for degrees of unsolvability
• Forcing and reducibilities
• Minimal predicates for \(\Delta \)-definability
• There exists a maximal 3-c.e. enumeration degree
• The decision problem for recursively enumerable degrees
• Recursive Enumerability and the Jump Operator
• \(\Pi_1^0\) classes and minimal degrees
• On the structures inside truth-table degrees
• Lowness for Kurtz randomness
• The structure of the honest polynomial m-degrees

This page was built for publication: On degrees of recursive unsolvability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768100)