Every recursive boolean algebra is isomorphic to one with incomplete atoms

Annals of Pure and Applied Logic 60 (3):193-206 (1993)
  Copy   BIBTEX

Abstract

The theorem of the title is proven, solving an old question of Remmel. The method of proof uses an algebraic technique of Remmel-Vaught combined with a complex tree of strategies argument where the true path is needed to figure out the final isomorphism

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(93)90075-o

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

BERGER, U., Total sets and objects in domain theory DOWNEY, R., Every recursive boolean algebra is isomorphic to one with incomplete atoms GONCHAREV, S., YAKHNIS, A. and YAKHNIS, V., Some effectively infinite classes of enumerations. [REVIEW]P. Lincoln, A. Scedrov & N. Shankar - 1993 - Annals of Pure and Applied Logic 60:291.
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
is a set B with Boolean operations a∨ b (join), a∧ b (meet) and− a (complement), partial ordering a≤ b defined by a∧ b= a and the smallest and greatest element, 0 and 1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty set S, under operations a∪ b, a∩ b, S− a, ordered by inclusion, with 0=∅. [REVIEW]Mystery Of Measurability - 2006 - Bulletin of Symbolic Logic 12 (2).
Recursive Boolean algebras with recursive atoms.Jeffrey B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):595-616.
Boolean Algebras, Stone Spaces, and the Iterated Turing Jump.Carl G. Jockusch & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (4):1121 - 1138.
Hyper-Archimedean BL-algebras are MV-algebras.Esko Turunen - 2007 - Mathematical Logic Quarterly 53 (2):170-175.
The Boolean algebra of objectives.Boguslaw Wolniewicz - 1981 - Bulletin of the Section of Logic 10 (1):17-22.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
The number of openly generated Boolean algebras.Stefan Geschke & Saharon Shelah - 2008 - Journal of Symbolic Logic 73 (1):151-164.
A superatomic Boolean algebra with few automorphisms.Matatyahu Rubin & Sabine Koppelberg - 2001 - Archive for Mathematical Logic 40 (2):125-129.
Boolean products of R0-algebras.Xiangnan Zhou & Qingguo Li - 2010 - Mathematical Logic Quarterly 56 (3):289-298.
Rumely Domains with Atomic Constructible Boolean Algebra. An Effective Viewpoint.Claude Sureson - 2007 - Notre Dame Journal of Formal Logic 48 (3):399-423.

Analytics

Added to PP
2014-01-16

Downloads
16 (#910,507)

6 months
5 (#647,370)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degrees of orders on torsion-free Abelian groups.Asher M. Kach, Karen Lange & Reed Solomon - 2013 - Annals of Pure and Applied Logic 164 (7-8):822-836.
Decidable Boolean algebras of low level.S. S. Goncharov - 1998 - Annals of Pure and Applied Logic 94 (1-3):75-95.

View all 6 citations / Add more citations

References found in this work

Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Hiearchies of Boolean algebras.Lawrence Feiner - 1970 - Journal of Symbolic Logic 35 (3):365-374.
Recursive Boolean algebras with recursive atoms.Jeffrey B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):595-616.

Add more references