On the $n$-back-and-forth types of Boolean algebras
From MaRDI portal
Publication:3116576
DOI10.1090/S0002-9947-2011-05331-6zbMath1248.03067MaRDI QIDQ3116576
Antonio Montalbán, Kenneth D. Harris
Publication date: 24 February 2012
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-2011-05331-6
03D80: Applications of computability and recursion theory
06E05: Structure theory of Boolean algebras
03C57: Computable structure theory, computable model theory
Related Items
Cuts of linear orders, Coding and definability in computable structures, Rice sequences of relations, Enumeration Reducibility and Computable Structure Theory, On the $n$-back-and-forth types of Boolean algebras, Boolean algebra approximations, A robuster Scott rank, Notes on the Jump of a Structure
Cites Work
- Unnamed Item
- Unnamed Item
- Pairs of recursive structures
- Stability of recursive structures in arithmetical degrees
- Minimally generated Boolean algebras
- Topological model theory
- Alternative characterizations of finitary and well-founded Boolean algebras
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- Back and forth relations for reduced abelian \(p\)-groups
- Boolean algebras, Tarski invariants, and index sets
- Computable Boolean algebras
- On the $n$-back-and-forth types of Boolean algebras
- The isomorphism problem for computable Abelian p-groups of bounded length
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Comparing The Expressive Power of Some Languages for Boolean Algebras
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Boolean algebras, Stone spaces, and the iterated Turing jump
- Every Low 2 Boolean Algebra has a Recursive Copy
