Degree Structures: Local and Global Investigations

DOI10.2178/BSL/1154698739MaRDI QIDQ3412461zbMATH OpenOpenAlexFDO

Authors Richard A. Shore

Publication date 6 December 2006

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6f34e083bc9196db3b27e0f8e8b0dd104f2d2768

zbMATH Keywords

halting problemrecursively enumerable degreesTuring degree structures

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• An extension of the recursively enumerable Turing degrees
• scientific article; zbMATH DE number 3914306
• scientific article; zbMATH DE number 1390015
• scientific article; zbMATH DE number 3857082
• scientific article; zbMATH DE number 66485

Cites work

• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
• A General Framework for Priority Arguments
• A minimal degree less than 0’
• A minimal pair of recursively enumerable degrees
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
• A splitting theorem for n-REA degrees
• Algebraic aspects of the computably enumerable degrees.
• Definable degrees and automorphisms of 𝒟
• Defining the Turing jump
• Degrees of Unsolvability. (AM-55)
• Distributive Initial Segments of the Degrees of Unsolvability
• Embedding jump upper semilattices into the Turing degrees
• Extension of embeddings in the computably enumerable degrees
• First-order theory of the degrees of recursive unsolvability
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• Initial segments of the degrees of unsolvability
• Inspheres and inner products
• Interpretability and Definability in the Recursively Enumerable Degrees
• Jump embeddings in the Turing degrees
• Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
• Lattice embeddings into the recursively enumerable degrees
• Lattice embeddings into the recursively enumerable degrees. II
• Local Initial Segments of The Turing Degrees
• Minimal degrees and the jump operator
• Not every finite lattice is embeddable in the recursively enumerable degrees
• On a Conjecture of Kleene and Post
• On degrees of recursive unsolvability
• On homogeneity and definability in the first-order theory of the Turing degrees
• On the Σ₂-theory of the upper semilattice of Turing degrees
• On the degrees less than 0'
• PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Recursion theory and complexity. Proceedings of the Kazan '97 workshop, Kazan, Russia, July 14--19, 1997
• Reducibility orderings: Theories, definability and automorphisms
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
• The homogeneity conjecture
• The impossibility of finding relative complements for recursively enumerable degrees
• The jump is definable in the structure of the degrees of unsolvability
• The recursively enumerable degrees are dense
• The recursively enumerable degrees have infinitely many one-types
• The undecidability of the recursively enumerable degrees
• The upper semi-lattice of degrees of recursive unsolvability
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Undecidability and 1-types in the recursively enumerable degrees

Cited in

(17)

• Online presentations of finitely generated structures
• Set-theoretic blockchains
• Extensions of embeddings below computably enumerable degrees
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
• Early investigations of the degrees of Borel sets
• scientific article; zbMATH DE number 3857082 (Why is no real title available?)
• The Structure of Detour Degrees
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• The First Order Theories of the Medvedev and Muchnik Lattices
• scientific article; zbMATH DE number 3914306 (Why is no real title available?)
• scientific article; zbMATH DE number 3977006 (Why is no real title available?)
• Coding true arithmetic in the Medvedev degrees of ^0_1 classes
• The degrees of conditional problems
• Enumerations, countable structures and Turing degrees
• scientific article; zbMATH DE number 1531937 (Why is no real title available?)
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES

This page was built for publication: Degree Structures: Local and Global Investigations

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