Recursive isomorphism types of recursive Boolean algebras
From MaRDI portal
Publication:3331214
DOI10.2307/2273757zbMath0543.03031OpenAlexW1973880596MaRDI QIDQ3331214
Publication date: 1981
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273757
idealrecursive isomorphism typerecursive Boolean algebrarecursion-theoretic properties of the set of atoms
Boolean algebras (Boolean rings) (06E99) Recursive equivalence types of sets and structures, isols (03D50) Theory of numerations, effectively presented structures (03D45)
Related Items
Degree spectra of relations on structures of finite computable dimension, Recursive unary algebras and trees, Degrees of autostability for prime Boolean algebras, Strong constructibility of Boolean algebras of elementary characteristic (1,1,0), Recursively rigid Boolean algebras, Structures computable in polynomial time. II, Quasi-simple relations in copies of a given recursive structure, Lattice of recursively enumerable subalgebras of a recursive Boolean algebra, Recursive Boolean algebras with a hyperhyperimmune set of atoms, Autostable atomic-ideal enrichments of computable Boolean algebras, 1994 Annual Meeting of the Association for Symbolic Logic, Computable isomorphisms for certain classes of infinite graphs, Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism, The branching theorem and computable categoricity in the Ershov hierarchy, Punctual copies of algebraic structures, Turing degrees of hypersimple relations on computable structures, Computable Stone spaces, Computable Heyting algebras with distinguished atoms and coatoms, On the triple jump of the set of atoms of a Boolean algebra, Boolean algebras autostable relative to \(n\)-decidable presentations, Degrees of categoricity for superatomic Boolean algebras, Analytic computable structure theory and $L^p$ spaces, Recursively Categorical Linear Orderings, Splitting recursively enumerable subalgebras in recursive Boolean algebras, Computable bi-embeddable categoricity, Categoricity for primitive recursive and polynomial Boolean algebras, Computability-theoretic categoricity and Scott families, Recursive Linear Orders with Incomplete Successivities, A construction of Boolean algebras from first-order structures, Recursive properties of relations on models, Computable isomorphisms of Boolean algebras with operators, Every recursive Boolean algebra is isomorphic to one with incomplete atoms, 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms, Effective categoricity of equivalence structures, Every Low Boolean Algebra is Isomorphic to a Recursive One, Categoricity spectra of computable structures, Degree spectra of the successor relation of computable linear orderings, Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007, Constructive enumeration of Boolean lattices, Effective categoricity of abelian \(p\)-groups, Computably categorical Boolean algebras enriched by ideals and atoms, Nilpotent groups of finite algorithmic dimension, Computable isomorphisms, degree spectra of relations, and Scott families, Decidable Boolean algebras of low level, Computable categoricity for algebraic fields with splitting algorithms, Categoricity properties for computable algebraic fields, \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
Cites Work
