Proper Forcing
Proper Forcing is a class of forcing notions in set theory that preserves stationary subsets of ω₁, thereby maintaining the truth of certain combinatorial statements in the generic extension while allowing for the manipulation of cardinal characteristics.
53
Publications
1.5K
Citations
55
Authors
51
Institutions
Publications per year
2017–2026
0
53
PFA implies AD<sup><i>L</i>(ℝ)</sup>
John R. Steel · Journal of Symbolic Logic · 2005 · 70 citations
The bounded proper forcing axiom
Martin Goldstern, Saharon Shelah · Journal of Symbolic Logic · 1995 · 69 citations · Full text
Justin Tatch Moore · Journal of Mathematical Logic · 2005 · 68 citations · Full text
TOOLS FOR YOUR FORCING CONSTRUCTION
Martin Goldstern · 1992 · 65 citations
1–5 of 53
55
10
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 55
51
Hebrew University of Jerusalem
Jerusalem, Israel
7 h-index
8 publications
304 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
5 h-index
6 publications
220 citations

York University
Toronto, Canada
4 h-index
9 publications
308 citations
Boise State University
Boise, United States
3 h-index
4 publications
273 citations
Czech Academy of Sciences, Institute of Mathematics
Prague, Czechia
3 h-index
3 publications
50 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
102 citations
University of Vienna
Vienna, Austria
3 h-index
3 publications
94 citations
University of Münster
Münster, Germany
3 h-index
4 publications
93 citations
1–8 of 51
12 publications · 403 citations
11
h-index
PROC · 3 publications · 104 citations
3
h-index
3 publications · 75 citations
3
h-index
3 publications · 53 citations
3
h-index
3 publications · 41 citations
3
h-index
1–5