We investigate the statement "all automorphisms of P(λ)=[λ]<λ are trivial". We show that MA implies the statement for regular uncountable < 2 0 ; that the statement is false for measurable λ if 2λ = λ+; and that for "densely trivial"it can be forced (together with 2λ = λ++) for inaccessible λ.
en
Project title:
Forcing für Mengen- und Modelltheorie: P 33420-N (FWF - Österr. Wissenschaftsfonds) Boolesche Ultrapotenzen und andere neue Forcing-Techniken: P33895 (FWF - Österr. Wissenschaftsfonds)