ON AUTOMORPHISMS OF P(λ)/[λ]<λ

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)1476-1512
Number of pages37
JournalJournal of Symbolic Logic
Volume89
Issue number4
DOIs
Publication statusPublished - 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