Undecidability and 1-types in the recursively enumerable degrees

DOI10.1016/0168-0072(93)90206-SMaRDI QIDQ688787zbMATH OpenOpenAlexFDO

Authors Richard A. Shore, Klaus Ambos-Spies

Publication date 5 June 1994

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(93)90206-s

zbMATH Keywords

codingfinite partial orderingsrecursively enumerable degreesundecidable first-order theory

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}
• Publication:4934281
• Definability in the enumeration degrees
• scientific article; zbMATH DE number 194103
• scientific article; zbMATH DE number 535104
• Initial segments of the degrees of size \(\aleph _ 1\)
• Undecidability of the structure of the Solovay degrees of c.e. reals
• scientific article; zbMATH DE number 4204326
• Decidability and undecidability in the enumerable Turing degrees
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical

Cites work

• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3304986 (Why is no real title available?)
• scientific article; zbMATH DE number 3305000 (Why is no real title available?)
• scientific article; zbMATH DE number 3319532 (Why is no real title available?)
• A minimal pair of recursively enumerable degrees
• Branching Degrees above low Degrees
• Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees
• Finitely Generated Codings and the Degrees R.E. in a Degree d
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• On Suborderings of Degrees of Recursive Unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• The density of infima in the recursively enumerable degrees
• The density of the nonbranching degrees
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• The recursively enumerable degrees are dense
• The recursively enumerable degrees have infinitely many one-types
• The undecidability of the recursively enumerable degrees

Cited in

(17)

• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• scientific article; zbMATH DE number 3880676 (Why is no real title available?)
• Definability in the Recursively Enumerable Degrees
• The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees
• Incomparable prime ideals of recursively enumerable degrees
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• 1996–97 Annual Meeting of the Association for Symbolic Logic
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• Degree Structures: Local and Global Investigations
• Generalized nonsplitting in the recursively enumerable degrees
• Undecidable fragments of elementary theories
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• The discontinuity of splitting in the recursively enumerable degrees
• scientific article; zbMATH DE number 3896923 (Why is no real title available?)
• Undecidability and 1-types in intervals of the computably enumerable degrees
• The recursively enumerable degrees have infinitely many one-types
• The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations

This page was built for publication: Undecidability and 1-types in the recursively enumerable degrees

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