Computability of boolean algebras and their extensions

DOI10.1016/0003-4843(73)90005-3zbMATH Open0272.02061OpenAlexW1997325822MaRDI QIDQ3214908FDOQ3214908

Authors: Donald A. Alton, Eugene W. Madison 

Publication date: 1973

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(73)90005-3

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Applications of computability and recursion theory (03D80) Logical aspects of Boolean algebras (03G05) Proof theory and constructive mathematics (03F99)

Cited In (2)

• The existence of countable totally nonconstructive extensions of the countable atomless Boolean algebra
• A hierarchy of regular open sets of the Cantor space

This page was built for publication: Computability of boolean algebras and their extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3214908)