@article{36a5ac7a0eee439eaa8368a0cda31f14,
title = "ON AUTOMORPHISMS OF P(λ)/[λ]<λ",
abstract = "We investigate the statement {"}all automorphisms of \$\textbackslash{}mathcal P(\textbackslash{}lambda)/[\textbackslash{}lambda]\textasciicircum{}\{\textbackslash{}lt \textbackslash{}lambda\}\$ are trivial using set theory. We first show that MA imples the statement for regular uncountable cardinals \$\textbackslash{}lamba < 2\textasciicircum{}\{\textbackslash{}aleph\_0\}\$ and the statement is false for measurable \$\textbackslash{}lambda\$ if \$2\textasciicircum{}\textbackslash{}lamba =\textbackslash{}lambda\textasciicircum{}\{+\}\$. Then we construct a creature forcing to show that for {"}densly trivial{"}, the statement can be forced for inaccesible cardinals \$\textbackslash{}lambda\$ (together with \$2\textasciicircum{}\{\textbackslash{}lambda\}=\textbackslash{}lambda\textasciicircum{}\{++\}\$",
author = "J.A.K.O.B. Kellner and S. Shelah and A.R. T{\u A}nasie",
note = "Publisher Copyright: {\textcopyright} 2024 Cambridge University Press. All rights reserved.",
year = "2024",
month = apr,
day = "16",
doi = "10.1017/jsl.2024.37",
language = "English",
journal = "Journal of Symbolic Logic",
issn = "0022-4812",
publisher = "Cambridge University Press",
}