Boolean algebras, Tarski invariants, and index sets

DOI10.1305/ndjfl/1143468308zbMath1107.03031MaRDI QIDQ2505128

Antonio Montalbán, Richard A. Shore, Barbara F. Csima

Publication date: 4 October 2006

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1143468308

zbMATH Keywords

Boolean algebras; computability; index sets; Tarski invariants

Mathematics Subject Classification ID

03D50: Recursive equivalence types of sets and structures, isols

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

Invariants, Boolean algebras and ACA₀⁺, The index set of Boolean algebras autostable relative to strong constructivizations, Computable numberings of the class of Boolean algebras with distinguished endomorphisms, Fine hierarchies and m-reducibilities in theoretical computer science, Index sets for some classes of structures, Scott sentences for certain groups, On the $n$-back-and-forth types of Boolean algebras

Cites Work

• Strong constructivizability of countable saturated Boolean algebras
• Arithmetic hierarchy and ideals of enumerated Boolean algebras
• Index sets of classes of hyper-hypersimple sets
• Computable structures and the hyperarithmetical hierarchy
• Fine hierarchy and definable index sets
• The isomorphism problem for computable Abelian _p-groups of bounded length
• $∀_n$-theories of Boolean algebras
• Invariants, Boolean algebras and ACA₀⁺
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item