Forcing minimal degree of constructibility
Journal of Symbolic Logic 56 (3):769-782 (1991)
Abstract
In this paper we will study four forcing notions, two of them giving a minimal degree of constructibility. These constructions give answers to questions in [Ih]DOI
10.2178/jsl/1183743725
My notes
Similar books and articles
Souslin forcing.Jaime I. Ihoda & Saharon Shelah - 1988 - Journal of Symbolic Logic 53 (4):1188-1207.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Simple forcing notions and forcing axioms.Andrzej Rosłanowski & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (4):1297-1314.
Minimal Complements for Degrees below 0´.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937 - 966.
Minimal groups in separably closed fields.E. Bouscaren & F. Delon - 2002 - Journal of Symbolic Logic 67 (1):239-259.
Forcing many positive polarized partition relations between a cardinal and its powerset.Saharon Shelah & Lee J. Stanley - 2001 - Journal of Symbolic Logic 66 (3):1359-1370.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Analytics
Added to PP
2009-01-28
Downloads
14 (#733,752)
6 months
1 (#454,876)
2009-01-28
Downloads
14 (#733,752)
6 months
1 (#454,876)
Historical graph of downloads
Citations of this work
Combinatorics and forcing with distributive ideals.Pierre Matet - 1997 - Annals of Pure and Applied Logic 86 (2):137-201.
References found in this work
There may be simple Pℵ1 and Pℵ2-points and the Rudin-Keisler ordering may be downward directed.Andreas Blass & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):213-243.
Δ12-sets of reals.Jaime I. Ihoda & Saharon Shelah - 1989 - Annals of Pure and Applied Logic 42 (3):207-223.
Selective ultrafilters and homogeneity.Andreas Blass - 1988 - Annals of Pure and Applied Logic 38 (3):215-255.