Undecidability and 1-types in the recursively enumerable degrees

DOI10.1016/0168-0072(93)90206-SzbMath0788.03062OpenAlexW2010076006MaRDI QIDQ688787

Richard A. Shore, Ambos-Spies, Klaus

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

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

Related Items

The discontinuity of splitting in the recursively enumerable degrees, Interpreting true arithmetic in the theory of the r.e. truth table degrees, Undecidable fragments of elementary theories, The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees, Generalized nonsplitting in the recursively enumerable degrees, 1996–97 Annual Meeting of the Association for Symbolic Logic, Incomparable prime ideals of recursively enumerable degrees, Degree Structures: Local and Global Investigations, The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable, Definability in the Recursively Enumerable Degrees, Undecidability and 1-types in intervals of the computably enumerable degrees

Cites Work

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