
arXiv: 2411.11577
If $\lambda$ is (strongly) inaccessible and $2^\lambda = \lambda^+$, then there is a nowhere trivial automorphism of the Boolean algebra $\mathcal P(\lambda)/[\lambda]^{<\lambda}$.
Mathematics - Logic
Mathematics - Logic
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
