\(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
From MaRDI portal
Publication:1861536
DOI10.1016/S0168-0072(02)00035-0zbMath1016.03036OpenAlexW2090545214MaRDI QIDQ1861536
Publication date: 9 March 2003
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(02)00035-0
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)
Related Items (21)
Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ Abelian \(p\)-groups and the halting problem ⋮ Effectively categorical abelian groups ⋮ Computable completely decomposable groups ⋮ On limitwise monotonicity and maximal block functions ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Punctual copies of algebraic structures ⋮ Automorphisms ofη-like computable linear orderings and Kierstead's conjecture ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ Computability-theoretic categoricity and Scott families ⋮ Computability of distributive lattices ⋮ Computable categoricity and the Ershov hierarchy ⋮ 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Effective categoricity of equivalence structures ⋮ Degrees of autostability relative to strong constructivizations ⋮ Categoricity spectra of computable structures ⋮ Effective categoricity of abelian \(p\)-groups ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive linear orders with recursive successivities
- Generic copies of countable structures
- Autostability of models and Abelian groups
- Autostability of models
- Problem of the number of non-self-equivalent constructivizations
- Autostability and computable families of constructivizations
- The quantity of nonautoequivalent constructivizations
- Criteria of autostability for 1-decidable models
- Model theory
- Computable structures and the hyperarithmetical hierarchy
- Computable Boolean algebras
- Recursive isomorphism types of recursive Boolean algebras
- Recursively Categorical Linear Orderings
- Effective model theory vs. recursive model theory
This page was built for publication: \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
