The noncommutativity of random and generic extensions

Journal of Symbolic Logic 48 (4):1008-1012 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273665

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
On generic extensions without the axiom of choice.G. P. Monro - 1983 - Journal of Symbolic Logic 48 (1):39-52.
Every 1-Generic Computes a Properly 1-Generic.Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1385 - 1393.
Generic extensions and elementary embeddings.Claes Åberg - 1975 - Theoria 41 (2):96-104.
The degrees below a 1-generic degree $.Christine Ann Haught - 1986 - Journal of Symbolic Logic 51 (3):770 - 777.
Generics and defaults.Francis Jeffry Pelletier & Nicholas Asher - 1996 - In Handbook of Logic and Language. Amsterdam [etc.]; Cambridge, MA:
On the construction of effectively random sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.
Subclasses of the Weakly Random Reals.Johanna N. Y. Franklin - 2010 - Notre Dame Journal of Formal Logic 51 (4):417-426.

Analytics

Added to PP
2009-01-28

Downloads
205 (#93,573)

6 months
10 (#219,185)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Combinatorial properties of classical forcing notions.Jörg Brendle - 1995 - Annals of Pure and Applied Logic 73 (2):143-170.

Add more citations

References found in this work

No references found.

Add more references