Arithmetic hierarchy and ideals of enumerated Boolean algebras

DOI10.1007/BF00970918MaRDI QIDQ922530zbMATH OpenOpenAlexFDO

Authors S. P. Odintsov, Victor Selivanov

Publication date 1989

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00970918

zbMATH Keywords

arithmetical complexityenumerable Boolean algebrasidealsquotient Boolean algebras

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Review text

The paper is devoted to enumerable Boolean algebras of arithmetical complexity. It is proved that every \(\Pi_ 1\) Boolean algebra is recursive and every \(\Pi_{n+2}\) Boolean algebra is a \(\Sigma_{n+1}\) Boolean algebra. The complexity of quotient Boolean algebras with respect to some natural ideals is also studied.

Recommendations

• Publication:4936685
• Complexity-theoretic algebra. II: Boolean algebras
• scientific article; zbMATH DE number 2154083
• Arithmetic complexity of first-order definable subsets of recursive Boolean algebras
• scientific article; zbMATH DE number 934728

Cites work

• Hierarchies of Boolean algebras
• scientific article; zbMATH DE number 4085634 (Why is no real title available?)
• On the Lattice of Recursively Enumerable Sets

Cited in

(20)

• Decidable Boolean algebras of low level
• Recursive and r.e. quotient Boolean algebras
• Essential arities in algebras of finite type and arity trees
• Positive preorders
• Fine hierarchy and definable index sets
• Boolean algebras realized by c.e. equivalence relations
• Boolean algebras, Tarski invariants, and index sets
• A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
• scientific article; zbMATH DE number 1936726 (Why is no real title available?)
• scientific article; zbMATH DE number 2154083 (Why is no real title available?)
• scientific article; zbMATH DE number 1396733 (Why is no real title available?)
• scientific article; zbMATH DE number 1438908 (Why is no real title available?)
• Definable Subsets of Polynomial-Time Algebraic Structures
• Computable Stone spaces
• Separating notions in effective topology
• COMPUTABLY COMPACT METRIC SPACES
• Computable topological groups
• Universal Boolean algebras with applications to semantic classes of models
• Degree spectra of homeomorphism type of compact Polish spaces
• Complexity-theoretic algebra. II: Boolean algebras

This page was built for publication: Arithmetic hierarchy and ideals of enumerated Boolean algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922530)