Abstract
It is shown that PFA implies that all automorphisms of the Boolean algebra p(u/Finite are induced by almost-permutations of cj.
| Original language | English |
|---|---|
| Pages (from-to) | 1220-1225 |
| Number of pages | 6 |
| Journal | Proceedings of the American Mathematical Society |
| Volume | 104 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Dec 1988 |
Fingerprint
Dive into the research topics of 'Pfa implies all automorphisms are trivial'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver