On degrees of recursive unsolvability

DOI10.2307/1969604zbMATH Open0074.01302OpenAlexW2042499838MaRDI QIDQ768100FDOQ768100

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)

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