Abstract
We investigate the statement "all automorphisms of $\mathcal P(\lambda)/[\lambda]^{\lt \lambda}$ are trivial using set theory. We first show that MA imples the statement for regular uncountable cardinals $\lamba < 2^{\aleph_0}$ and the statement is false for measurable $\lambda$ if $2^\lamba =\lambda^{+}$. Then we construct a creature forcing to show that for "densly trivial", the statement can be forced for inaccesible cardinals $\lambda$ (together with $2^{\lambda}=\lambda^{++}$
| Original language | English |
|---|---|
| Pages (from-to) | 1476-1512 |
| Number of pages | 37 |
| Journal | Journal of Symbolic Logic |
| Volume | 89 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 16 Apr 2024 |
Keywords
- rigid Boolean algebras
- trivial automorphisms
Fingerprint
Dive into the research topics of 'ON AUTOMORPHISMS OF P(λ)/[λ]<λ'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver