Recursive Linear Orders with Incomplete Successivities

DOI10.2307/2001778zbMath0813.03028OpenAlexW4237606947MaRDI QIDQ3977226

Michael Moses, Rodney G. Downey

Publication date: 25 June 1992

Full work available at URL: https://doi.org/10.2307/2001778

zbMATH Keywords

recursive linear orderintrinsically complete successivities

Mathematics Subject Classification ID

Total orders (06A05) Theory of numerations, effectively presented structures (03D45)

Related Items

Degrees of orders on torsion-free abelian groups ⋮ Presentations of the successor relation of computable linear ordering ⋮ On the triple jump of the set of atoms of a Boolean algebra ⋮ A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation ⋮ Every recursive Boolean algebra is isomorphic to one with incomplete atoms ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of the successor relation of computable linear orderings ⋮ Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 ⋮ Degrees of orderings not isomorphic to recursive linear orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• Finite condensations of recursive linear orders
• Some properties of the constructivization of Boolean algebras
• Recursive isomorphism types of recursive Boolean algebras
• Recursive Boolean algebras with recursive atoms
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
• T-Degrees, Jump Classes, and Strong Reducibilities
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Reducibility and Completeness for Sets of Integers
• Hierarchies of Boolean algebras
• The strong homogeneity conjecture