Perfect-set forcing for uncountable cardinals

Annals of Mathematical Logic 19 (1-2):97-114 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,561

External links

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

Through your library

Analytics

Added to PP
2014-01-17

Downloads
22 (#947,658)

6 months
8 (#533,737)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Akihiro Kanamori
Boston University

Citations of this work

Regularity properties on the generalized reals.Sy David Friedman, Yurii Khomskii & Vadim Kulikov - 2016 - Annals of Pure and Applied Logic 167 (4):408-430.
Perfect trees and elementary embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
Easton’s theorem and large cardinals.Sy-David Friedman & Radek Honzik - 2008 - Annals of Pure and Applied Logic 154 (3):191-208.
Fusion and large cardinal preservation.Sy-David Friedman, Radek Honzik & Lyubomyr Zdomskyy - 2013 - Annals of Pure and Applied Logic 164 (12):1247-1273.
The tree property at א ω+2.Sy-David Friedman & Ajdin Halilović - 2011 - Journal of Symbolic Logic 76 (2):477 - 490.

View all 26 citations / Add more citations

References found in this work

Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
Iterated perfectset forcing.J. E. Baumgartner - 1979 - Annals of Mathematical Logic 17 (3):271.
Combinatorics on ideals and forcing.Serge Grigorieff - 1971 - Annals of Mathematical Logic 3 (4):363.

View all 6 references / Add more references