Effective categoricity of computable linear orderings

DOI10.1007/s10469-015-9362-5zbMath1361.03044OpenAlexW2193737693MaRDI QIDQ5965136

No author found.

Publication date: 2 March 2016

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-015-9362-5

Mathematics Subject Classification ID

Total orders (06A05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)

Related Items (12)

Effective categoricity for distributive lattices and Heyting algebras ⋮ A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ On decidable categoricity and almost prime models ⋮ Strong degrees of categoricity and weak density ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Computability-theoretic categoricity and Scott families ⋮ Computability of distributive lattices ⋮ Degrees of categoricity of rigid structures ⋮ Categoricity spectra of computable structures ⋮ Degree spectra of structures ⋮ Categorical linearly ordered structures

Cites Work

• Autostability of models
• Autostability and computable families of constructivizations
• Degrees of categoricity of computable structures
• Recursively Categorical Linear Orderings
• Orderings with αth Jump Degree 0 (α)
• Δ 2 0 -copies of linear orderings

This page was built for publication: Effective categoricity of computable linear orderings