Recursive Boolean algebras with recursive atoms

DOI10.2307/2273758zbMath0543.03032MaRDI 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 algebras; Fréchet sequence of ideals; recursive atoms

Mathematics Subject Classification ID

06E99: Boolean algebras (Boolean rings)

03D45: Theory of numerations, effectively presented structures

Related Items

Every Low Boolean Algebra is Isomorphic to a Recursive One, Algorithmic properties of branching models, Constructive enumeration of Boolean lattices, Recursive linear orders with recursive successivities, Atom-free ideals of constructive Boolean algebras, Automorphisms of constructivizations of Boolean algebras, Recursively rigid Boolean algebras, Every recursive Boolean algebra is isomorphic to one with incomplete atoms, Decidable Boolean algebras of low level, Recursive isomorphism types of recursive Boolean algebras, On the triple jump of the set of atoms of a Boolean algebra, Splitting recursively enumerable subalgebras in recursive Boolean algebras, Recursively Categorical Linear Orderings, Recursive Linear Orders with Incomplete Successivities

Cites Work

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