Recursively Categorical Linear Orderings

DOI10.2307/2043534zbMath0493.03022OpenAlexW4244700389MaRDI QIDQ3955343

Jeffery B. Remmel

Publication date: 1981

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

zbMATH Keywords

recursive structure

Mathematics Subject Classification ID

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

Related Items (51)

Degree spectra and computable dimensions in algebraic structures ⋮ The computable dimension of ordered abelian groups ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ Computable dimension for ordered fields ⋮ Recursive categoricity and recursive stability ⋮ A robuster Scott rank ⋮ Initial segments of computable linear orders with computable natural relations ⋮ Effectively categorical abelian groups ⋮ Structures computable in polynomial time. II ⋮ On limitwise monotonicity and maximal block functions ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Complexity and categoricity ⋮ Computable isomorphisms for certain classes of infinite graphs ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Graphs are not universal for online computability ⋮ Feasibly categorical models ⋮ Computable torsion abelian groups ⋮ On the effective universality of mereological theories ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Some Questions in Computable Mathematics ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ Computable bi-embeddable categoricity ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Computability-theoretic categoricity and Scott families ⋮ Computability of distributive lattices ⋮ Computable linear orders and the Ershov hierarchy ⋮ Computable categoricity and the Ershov hierarchy ⋮ 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups ⋮ Primitively recursively categorical linear orderings ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ Codings on linear orders and algorithmic independence of natural relations ⋮ Effective categoricity of equivalence structures ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Categoricity spectra of computable structures ⋮ Degree spectra of structures ⋮ Effective categoricity of computable linear orderings ⋮ Computable structures and operations on the space of continuous 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 ⋮ Linear orders with distinguished function symbol ⋮ Effective categoricity of abelian \(p\)-groups ⋮ Categorical linearly ordered structures ⋮ Nilpotent groups of finite algorithmic dimension ⋮ Computable categoricity for algebraic fields with splitting algorithms ⋮ Categoricity properties for computable algebraic fields ⋮ Relativizing computable categoricity ⋮ Recursive automorphisms of recursive linear orderings ⋮ Recursive linear orders with recursive successivities ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings ⋮ Computable linear orders and the ershov hierarchy

Cites Work

• Strong and weak constructivization and computable families
• Recursive isomorphism types of recursive Boolean algebras
• Recursive Boolean algebras with recursive atoms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursively Categorical Linear Orderings