Perfect Local Computability of Superatomic Boolean Algebras
- 23 Downloads
We prove that a superatomic Boolean algebra is perfectly locally computable if and only if its rank is a computable ordinal. Bibliography: 7 titles.
KeywordsBoolean Algebra Computable Function Injective Homomorphism Computable Presentation Perfect System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.S. S. Goncharov and Yu. L. Ershov, Constructive Models, Kluwer Academic/Plenum Press, New York (2002).Google Scholar
- 4.S. S. Goncharov, “Constructivizability of superatomic Boolean algebras” [in Russian], Algebra Logika 12, No. 1, 31–40 (1973).Google Scholar
- 7.G. E. Sacks, Higher Recursion Theory Springer, Berlin etc. (1990).Google Scholar
© Springer Science+Business Media New York 2015