Adding Total Indiscernibles to Models of Set Theory |
Common terms and phrases
a a limit abstraction term adding ordinals axiom of choice belong bels c₁ cardinals Chapter Co,a cofinalities constants are added contains labels contradictable pair countable model countable sets define the action definition domain and range Douglass Bert Morris E-relations efficient label elements fixed elements of E(c elements of rank exists f-condition finite orders finitely many elements fix ordinals fixes all elements forcing argument forcing conditions Froof ground model hold induction integers Jerome Keisler large cardinal Lemma limit ordinal mapping metalanguage model N model of ZFC models of ZF nice Cohen extension P-function partial automorphism permutation power set proper class prove ranked formulas replacement Section set of indiscernibles set theory sets of total subscripts symmetry argument thesis tion total indiscernibles ultrafilter University of Wisconsin unranked well-ordered x₁ ZF with Automorphisms ZF(J ZFC without adding α α