The upper semi-lattice of degrees of recursive unsolvability
From MaRDI portal
Publication:2652167
DOI10.2307/1969708zbMath0057.24703WikidataQ56430698 ScholiaQ56430698MaRDI QIDQ2652167
Publication date: 1954
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1969708
Related Items
Embedding jump upper semilattices into the Turing degrees, On minimal pairs of enumeration degrees, Decidability of the “almost all” theory of degrees, The ∀∃-theory of ℛ(≤,∨,∧) is undecidable, The Mathematical Work of S.C.Kleene, A General Framework for Priority Arguments, Lattice initial segments of the hyperdegrees, Undecidability and initial segments of the (r.e.) tt-degrees, Unnamed Item, The Complexity of Orbits of Computably Enumerable Sets, Unnamed Item, On Reducibility by Recursive Functions, Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond, On the notational independence of various hierarchies of degrees of unsolvability, Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit, On complete degrees, A theorem on minimal degrees, Minimal Covers and Arithmetical Sets, Hierarchies in Recursive Function Theory, Recursive Enumerability and the Jump Operator, On the theory of the PTIME degrees of the recursive sets, Computing degrees of unsolvability, Goodness in the enumeration and singleton degrees, Turing oracle machines, online computing, and three displacements in computability theory, The density of the nonbranching degrees, On effectively computable realizations of choice functions, The minimum degree of recursively representable choice functions, Not every finite lattice is embeddable in the recursively enumerable degrees, Countable admissible ordinals and hyperdegrees, The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory, Augmented loop languages and classes of computable functions, An oracle builder's toolkit, Lattice nonembeddings and intervals of the recursively enumerable degrees, A semantical proof of De Jongh's theorem, Initial segments of the degrees of size \(\aleph _ 1\), Priority constructions, The minimum of two regressive isols, Infima of d.r.e. degrees, Complementation in the Turing degrees, Forcing and reducibilities, Unnamed Item, Decomposition and infima in the computably enumerable degrees, Hierarchies of number-theoretic predicates, Recursive well-orderings, A criterion for completeness of degrees of unsolvability, Measure-theoretic construction of incomparable hyperdegrees, Gödel numberings of partial recursive functions, Degrees of models, Discontinuities of provably correct operators on the provably recursive real numbers, Arithmetical Predicates and Function Quantifiers, Degree Structures: Local and Global Investigations, Some Theorems on Classes of Recursively Enumerable Sets, On a Subrecursive Hierarchy and Primitive Recursive Degrees, Constructive Versions of Ordinal Number Classes, Independence Results on the Global Structure of the Turing Degrees, The jump is definable in the structure of the degrees of unsolvability, DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP, Infima of d.r.e. Degrees, Decidability and Invariant Classes for Degree Structures, Mass Problems and Measure-Theoretic Regularity, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers, On the embedding of α-recursive presentable lattices into the α-recursive degrees below 0′, The degrees below a 1-generic degree < 0′, Definable degrees and automorphisms of 𝒟, An Uncountable Set of Incomparable Degrees, Jump embeddings in the Turing degrees, A survey of partial degrees, The decision problem for recursively enumerable degrees, Banach–Mazur games, comeager sets and degrees of unsolvability, A Theorem on Intermediate Reducibilities, Recursively enumerable sets and degrees
