Pages that link to "Item:Q3331214"
From MaRDI portal
The following pages link to Recursive isomorphism types of recursive Boolean algebras (Q3331214):
Displayed 35 items.
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism (Q384395) (← links)
- Autostable atomic-ideal enrichments of computable Boolean algebras (Q600736) (← links)
- A construction of Boolean algebras from first-order structures (Q685061) (← links)
- Recursive properties of relations on models (Q687281) (← links)
- Computable isomorphisms of Boolean algebras with operators (Q694494) (← links)
- Constructive enumeration of Boolean lattices (Q752699) (← links)
- Computably categorical Boolean algebras enriched by ideals and atoms (Q764268) (← links)
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Degree spectra of the successor relation of computable linear orderings (Q1005920) (← links)
- Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 (Q1005921) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- Recursively rigid Boolean algebras (Q1101105) (← links)
- Lattice of recursively enumerable subalgebras of a recursive Boolean algebra (Q1113895) (← links)
- Recursive Boolean algebras with a hyperhyperimmune set of atoms (Q1119571) (← links)
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms (Q1210349) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Decidable Boolean algebras of low level (Q1295398) (← links)
- Recursive unary algebras and trees (Q1326781) (← links)
- Strong constructibility of Boolean algebras of elementary characteristic (1,1,0) (Q1346920) (← links)
- Quasi-simple relations in copies of a given recursive structure (Q1365244) (← links)
- Turing degrees of hypersimple relations on computable structures (Q1399102) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- Nilpotent groups of finite algorithmic dimension (Q1825277) (← links)
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings (Q1861536) (← links)
- Degrees of categoricity for superatomic Boolean algebras (Q2434601) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- On the triple jump of the set of atoms of a Boolean algebra (Q3508087) (← links)
- Splitting recursively enumerable subalgebras in recursive Boolean algebras (Q3804687) (← links)
- Recursively Categorical Linear Orderings (Q3955343) (← links)
- Recursive Linear Orders with Incomplete Successivities (Q3977226) (← links)
- Every Low Boolean Algebra is Isomorphic to a Recursive One (Q4318310) (← links)
- 1994 Annual Meeting of the Association for Symbolic Logic (Q4837677) (← links)
- Computable categoricity for algebraic fields with splitting algorithms (Q5246987) (← links)
- Categoricity properties for computable algebraic fields (Q5246988) (← links)
- 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms (Q5741344) (← links)