Embedding theorems for Boolean algebras and consistency results on ordinal definable sets

Journal of Symbolic Logic 42 (1):64-76 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,919

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

Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
Free Extensions of Sets of Boolean Algebras.F. M. Yaqub - 1971 - Journal of Symbolic Logic 36 (1):163-164.
Recursive and r.e. quotient Boolean algebras.John J. Thurber - 1994 - Archive for Mathematical Logic 33 (2):121-129.

Analytics

Added to PP
2009-01-28

Downloads
50 (#483,483)

6 months
16 (#195,623)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Boolean Algebras.Roman Sikorski - 1966 - Journal of Symbolic Logic 31 (2):251-253.
Consistency results about ordinal definability.Kenneth McAloon - 1971 - Annals of Mathematical Logic 2 (4):449.
Forcing with trees and order definability.Thomas J. Jech - 1975 - Annals of Mathematical Logic 7 (4):387.

Add more references