Journal of Symbolic Logic 48 (3):882-883 (1983)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273492
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,848
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Iterated Perfect-Set Forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
On the Consistency of Borel's Conjecture.Richard Laver & James E. Baumgartner - 1983 - Journal of Symbolic Logic 48 (3):882-883.
The Γ-Borel Conjecture.Arnold W. Miller - 2005 - Archive for Mathematical Logic 44 (4):425-434.
Sacks Forcing, Laver Forcing, and Martin's Axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
Combinatorial Properties of Classical Forcing Notions.Jörg Brendle - 1995 - Annals of Pure and Applied Logic 73 (2):143-170.
Removing Laver Functions From Supercompactness Arguments.Arthur W. Apter - 2005 - Mathematical Logic Quarterly 51 (2):154.
Strongly Dominating Sets of Reals.Michal Dečo & Miroslav Repický - 2013 - Archive for Mathematical Logic 52 (7-8):827-846.
The Lottery Preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Mathias–Prikry and Laver–Prikry Type Forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
On Fraïssé's Order Type Conjecture.Richard Laver & Saharon Shelah - 1987 - Journal of Symbolic Logic 52 (2):571-574.
Laver Sequences for Extendible and Super-Almost-Huge Cardinals.Paul Corazza - 1999 - Journal of Symbolic Logic 64 (3):963-983.
Strong Cardinals Can Be Fully Laver Indestructible.Arthur W. Apter - 2002 - Mathematical Logic Quarterly 48 (4):499-507.
The Wholeness Axiom and Laver Sequences.Paul Corazza - 2000 - Annals of Pure and Applied Logic 105 (1-3):157-260.

Analytics

Added to PP index
2013-11-03

Total views
28 ( #380,261 of 2,433,036 )

Recent downloads (6 months)
1 ( #463,753 of 2,433,036 )

How can I increase my downloads?

Downloads

My notes