Abstract
It is shown that if k > 2n0 and k is less than the first inaccessible cardinal then every automorphism of P(k)/[k]>n0is trivial outside of a set of cardinality 2n0.
| Original language | English |
|---|---|
| Pages (from-to) | 167-181 |
| Number of pages | 15 |
| Journal | Fundamenta Mathematicae |
| Volume | 235 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2016 |
Bibliographical note
Publisher Copyright:© Instytut Matematyczny PAN, 2016.
Keywords
- Automorphism
- Dominating number
Fingerprint
Dive into the research topics of 'When automorphisms of P(k)/[k]<N0 are trivial off a small set'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver