The following pages link to Hierarchies of Boolean algebras (Q5626636):
Displaying 48 items.
- Computability on linear orderings enriched with predicates (Q431704) (← links)
- Hierarchies of torsion-free Abelian groups (Q579244) (← links)
- Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable (Q695763) (← links)
- Strongly \(\eta \)-representable degrees and limitwise monotonic functions (Q695785) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- Constructivizations of direct products of algebraic systems (Q787959) (← links)
- Arithmetic hierarchy and ideals of enumerated Boolean algebras (Q922530) (← links)
- Turing machine computations in finitely axiomatizable theories (Q1059628) (← links)
- Atom-free ideals of constructive Boolean algebras (Q1079562) (← links)
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures (Q1083446) (← links)
- Algorithmic complexity of algebraic systems (Q1121875) (← links)
- Countable thin \(\Pi^0_1\) classes (Q1208080) (← links)
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms (Q1210349) (← links)
- Some properties of the constructivization of Boolean algebras (Q1225613) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- Recursive and r.e. quotient Boolean algebras (Q1325051) (← links)
- \(\Pi_{1}^{0}\) classes and orderable groups (Q1612488) (← links)
- Negative dense linear orders (Q1745085) (← links)
- Arithmetic hierarchy of Abelian groups (Q1822631) (← links)
- Constructivizability of superatomic Boolean algebras (Q1843564) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Structures of degrees of negative representations of linear orders (Q2066437) (← links)
- Computably separable models (Q2168971) (← links)
- Boolean algebras realized by c.e. equivalence relations (Q2403654) (← links)
- \(\Pi^0_1\)-presentations of algebras (Q2505502) (← links)
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees (Q2750927) (← links)
- 2004 Summer Meeting of the Association for Symbolic Logic (Q3370624) (← links)
- Depth zero Boolean algebras (Q3581139) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Increasing <i>η</i> -representable degrees (Q3650322) (← links)
- Recursive Linear Orders with Incomplete Successivities (Q3977226) (← links)
- The Boolean algebra of logic (Q4087168) (← links)
- Every Low Boolean Algebra is Isomorphic to a Recursive One (Q4318310) (← links)
- Isomorphism of lattices of recursively enumerable sets (Q4337954) (← links)
- Effectively dense Boolean algebras and their applications (Q4505908) (← links)
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 (Q4678940) (← links)
- A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES (Q5052014) (← links)
- COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS (Q5316305) (← links)
- Degrees of Nonrecursive Presentability (Q5681987) (← links)
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM (Q5858927) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- Computable Stone spaces (Q6109093) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)
- Separating notions in effective topology (Q6142834) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
- Separable algorithmic representations of classical systems and their applications (Q6192015) (← links)
