The existence of countable totally nonconstructive extensions of the countable atomless Boolean algebra

Journal of Symbolic Logic 48 (1):167-170 (1983)
  Copy   BIBTEX

Abstract

Our results concern the existence of a countable extension U of the countable atomless Boolean algebra B such that U is a "nonconstructive" extension of B. It is known that for any fixed admissible indexing φ of B there is a countable nonconstructive extension U of B (relative to φ). The main theorem here shows that there exists an extension U of B such that for any admissible indexing φ of B, U is nonconstructive (relative to φ). Thus, in this sense U is a countable totally nonconstructive extension of B

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,486

External links

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

Through your library

Similar books and articles

Elementary extensions of countable models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (1):139-145.
Countable structures, Ehrenfeucht strategies, and wadge reductions.Tom Linton - 1991 - Journal of Symbolic Logic 56 (4):1325-1348.
A Spector-Gandy theorem for cPC d () classes.Shaughan Lavine - 1992 - Journal of Symbolic Logic 57 (2):478-500.
Locally countable models of Σ1-separation.Fred G. Abramson - 1981 - Journal of Symbolic Logic 46 (1):96 - 100.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Limit ultrapowers and abstract logics.Paolo Lipparini - 1987 - Journal of Symbolic Logic 52 (2):437-454.

Analytics

Added to PP
2009-01-28

Downloads
252 (#109,368)

6 months
14 (#195,031)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Boolean Algebras and their Recursive Completions.E. W. Madison - 1985 - Mathematical Logic Quarterly 31 (31-34):481-486.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Lectures on Boolean Algebras.Paul R. Halmos - 1966 - Journal of Symbolic Logic 31 (2):253-254.
Boolean Algebras.Roman Sikorski - 1966 - Journal of Symbolic Logic 31 (2):251-253.

Add more references