Hierarchies of Boolean algebras

DOI10.2307/2270692zbMath0222.02048OpenAlexW1505964586MaRDI QIDQ5626636

Lawrence Feiner

Publication date: 1971

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270692

Mathematics Subject Classification ID

Boolean algebras (Boolean rings) (06E99) Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Related Items (48)

\(\Pi_{1}^{0}\) classes and orderable groups ⋮ Atom-free ideals of constructive Boolean algebras ⋮ Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES ⋮ COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS ⋮ Computably separable models ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Algorithmic complexity of algebraic systems ⋮ A class of low linear orders having computable presentations ⋮ Computable Stone spaces ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ Separating notions in effective topology ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Computability on linear orderings enriched with predicates ⋮ Isomorphism of lattices of recursively enumerable sets ⋮ Arithmetic hierarchy and ideals of enumerated Boolean algebras ⋮ The Boolean algebra of logic ⋮ Negative dense linear orders ⋮ Recursive Linear Orders with Incomplete Successivities ⋮ Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees ⋮ Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable ⋮ Strongly \(\eta \)-representable degrees and limitwise monotonic functions ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Depth zero Boolean algebras ⋮ Every recursive Boolean algebra is isomorphic to one with incomplete atoms ⋮ Degrees of Nonrecursive Presentability ⋮ Some properties of the constructivization of Boolean algebras ⋮ On the Equimorphism Types of Linear Orderings ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 ⋮ Hierarchies of torsion-free Abelian groups ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ \(\Pi^0_1\)-presentations of algebras ⋮ Turing computability: structural theory ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Structures of degrees of negative representations of linear orders ⋮ Arithmetic hierarchy of Abelian groups ⋮ Increasing η -representable degrees ⋮ Index sets for \(\Pi^0_1\) classes ⋮ Constructivizations of direct products of algebraic systems ⋮ Constructivizability of superatomic Boolean algebras ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Turing machine computations in finitely axiomatizable theories ⋮ Effectively dense Boolean algebras and their applications ⋮ Recursive and r.e. quotient Boolean algebras

Cites Work

• Unnamed Item
• On some fundamental problems concerning isomorphism of Boolean algebras

This page was built for publication: Hierarchies of Boolean algebras