Arithmetic hierarchy and ideals of enumerated Boolean algebras

DOI10.1007/BF00970918zbMath0711.03016OpenAlexW2014131004MaRDI QIDQ922530

Sergei P. Odintsov, Victor L. 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

idealsarithmetical complexityenumerable Boolean algebrasquotient Boolean algebras

Mathematics Subject Classification ID

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

Related Items (10)

A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic ⋮ Fine hierarchy and definable index sets ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Computable Stone spaces ⋮ Separating notions in effective topology ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Positive preorders ⋮ Boolean algebras, Tarski invariants, and index sets ⋮ Decidable Boolean algebras of low level

Cites Work

• On the Lattice of Recursively Enumerable Sets
• Hierarchies of Boolean algebras
• Unnamed Item

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