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

DOI10.1016/0001-8708(84)90028-8zbMATH Open0559.03027OpenAlexW2091246156MaRDI QIDQ802550FDOQ802550

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

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

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)

Cites Work

• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Title not available (Why is that?)
• A minimal pair of recursively enumerable degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Title not available (Why is that?)
• Sublattices of the Recursively Enumerable Degrees

Cited In (17)

• Title not available (Why is that?)
• Undecidability and 1-types in intervals of the computably enumerable degrees
• Undecidability and 1-types in the recursively enumerable degrees
• The density of the nonbranching degrees
• Title not available (Why is that?)
• 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
• Every Δ20 degree is a strong degree of categoricity
• Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
• Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990

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)