The elementary theory of the recursively enumerable degrees is not _ 0-categorical

DOI10.1016/0001-8708(84)90028-8MaRDI QIDQ802550zbMATH OpenOpenAlexFDO

Authors Manuel Lerman, Richard A. Shore, Robert I. Soare

Publication date 1984

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0001-8708(84)90028-8

zbMATH Keywords

partially ordered set of r.e. degrees

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Lattice embeddings into the recursively enumerable degrees. II
• The degrees of categorical theories with recursive models
• Undecidability and 1-types in the recursively enumerable degrees
• scientific article; zbMATH DE number 749917
• scientific article; zbMATH DE number 3939344

Cites work

• scientific article; zbMATH DE number 3458600 (Why is no real title available?)
• scientific article; zbMATH DE number 3404227 (Why is no real title available?)
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Sublattices of the Recursively Enumerable Degrees

Cited in

(17)

• Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• Undecidability and 1-types in intervals of the computably enumerable degrees
• scientific article; zbMATH DE number 1752644 (Why is no real title available?)
• Undecidability and 1-types in the recursively enumerable degrees
• The density of the nonbranching degrees
• scientific article; zbMATH DE number 1848277 (Why is no real title available?)
• Lattice embeddings into the recursively enumerable degrees. II
• Recursion theory in a lower semilattice
• The recursively enumerable degrees have infinitely many one-types
• Turing computability: structural theory
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
• R.e. Prime powers and total rigidity
• Degree Structures: Local and Global Investigations
• Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
• Every Δ20 degree is a strong degree of categoricity
• Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees

This page was built for publication: The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical

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