Recursive linear orders with recursive successivities

DOI10.1016/0168-0072(84)90028-9zbMath0572.03025OpenAlexW1992932719MaRDI QIDQ1062051

Michael Moses

Publication date: 1984

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(84)90028-9

zbMATH Keywords

order typerecursive relationintrinsically recursively enumerablerecursive linear ordering

Mathematics Subject Classification ID

Models of other mathematical theories (03C65) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

Recursive categoricity and recursive stability ⋮ Initial segments of computable linear orders with computable natural relations ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n)) ⋮ Punctual 1-linear orders ⋮ Computable ideals in \(I\)-algebras ⋮ Computable torsion abelian groups ⋮ ON COHESIVE POWERS OF LINEAR ORDERS ⋮ Computable linear orders and the Ershov hierarchy ⋮ Codings on linear orders and algorithmic independence of natural relations ⋮ COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings ⋮ Computable linear orders and the ershov hierarchy

Cites Work

• Autostability of models and Abelian groups
• Autostability of models
• Some properties of the constructivization of Boolean algebras
• Recursive Boolean algebras with recursive atoms
• Effective content of field theory
• Recursively Categorical Linear Orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive linear orders with recursive successivities