Recursive Boolean algebras with recursive atoms

DOI10.2307/2273758zbMath0543.03032OpenAlexW2012413541MaRDI QIDQ3331215

Jeffery B. Remmel

Publication date: 1981

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

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

zbMATH Keywords

recursive Boolean algebrasFréchet sequence of idealsrecursive atoms

Mathematics Subject Classification ID

Boolean algebras (Boolean rings) (06E99) Theory of numerations, effectively presented structures (03D45)

Related Items

Atom-free ideals of constructive Boolean algebras, Automorphisms of constructivizations of Boolean algebras, Recursively rigid Boolean algebras, Computable Heyting algebras with distinguished atoms and coatoms, On the triple jump of the set of atoms of a Boolean algebra, Recursively Categorical Linear Orderings, Splitting recursively enumerable subalgebras in recursive Boolean algebras, Recursive Linear Orders with Incomplete Successivities, Algebraic structures computable without delay, Recursive isomorphism types of recursive Boolean algebras, Every recursive Boolean algebra is isomorphic to one with incomplete atoms, Eliminating unbounded search in computable algebra, Algorithmic properties of branching models, Every Low Boolean Algebra is Isomorphic to a Recursive One, Punctual dimension of algebraic structures in certain classes, Constructive enumeration of Boolean lattices, Decidable Boolean algebras of low level, Recursive linear orders with recursive successivities

Cites Work

• Some aspects of generalized computability
• The recursively enumerable degrees are dense
• Theorie Der Numerierungen III
• Unnamed Item