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