Embedding jump upper semilattices into the Turing degrees

DOI10.2178/JSL/1058448451MaRDI QIDQ4650267zbMATH OpenOpenAlexFDO

Authors Antonio Montalbán

Publication date 9 February 2005

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

Full work available at URL https://projecteuclid.org/euclid.jsl/1058448451

zbMATH Keywords

decidable existential theoryjump upper semilatticequantifier-free typeTuring degrees

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other Turing degree structures (03D28) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50)

Recommendations

• Jump embeddings in the Turing degrees
• scientific article; zbMATH DE number 4055595
• On the Σ₂-theory of the upper semilattice of Turing degrees
• scientific article; zbMATH DE number 4081536
• Martin's axiom and embeddings of upper semi-lattices into the Turing degrees
• A bounded jump for the bounded Turing degrees
• Computable embeddings of classes of structures under enumeration and Turing operators
• Embeddings into the Turing degrees
• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Turing computable embeddings of equivalences other than isomorphism

Cites work

• Computable structures and the hyperarithmetical hierarchy
• Distributive Initial Segments of the Degrees of Unsolvability
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• scientific article; zbMATH DE number 1421073 (Why is no real title available?)
• Initial segments of the degrees of size \(\aleph _ 1\)
• Jump embeddings in the Turing degrees
• On Suborderings of Degrees of Recursive Unsolvability
• Recursive Pseudo-Well-Orderings
• Set Theory
• Set theory. An introduction to independence proofs
• The \(\forall\exists\) theory of \({\mathcal D}(\leq,\vee,{}')\) is undecidable
• The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations
• The upper semi-lattice of degrees of recursive unsolvability

Cited in

(9)

• Degree Structures: Local and Global Investigations
• Decidability and Invariant Classes for Degree Structures
• On the T-degrees of partial functions
• scientific article; zbMATH DE number 4055595 (Why is no real title available?)
• scientific article; zbMATH DE number 4081536 (Why is no real title available?)
• Jump embeddings in the Turing degrees
• On the decidability of the \(\Sigma_2\) theories of the arithmetic and hyperarithmetic degrees as uppersemilattices
• scientific article; zbMATH DE number 1421073 (Why is no real title available?)
• There is no ordering on the classes in the generalized high/low hierarchies

This page was built for publication: Embedding jump upper semilattices into the Turing degrees

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