PFA Implies all Automorphisms are Trivial (Q3032245): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proper forcing / rank | |||
Normal rank | |||
Latest revision as of 11:14, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PFA Implies all Automorphisms are Trivial |
scientific article |
Statements
1988
0 references
proper forcing axiom
0 references
countable chain condition poset
0 references
PFA
0 references
automorphisms of the Boolean algebra \({\mathcal P}(\omega)\)/Finite
0 references
almost-permutations of \(\omega\)
0 references
PFA Implies all Automorphisms are Trivial (English)
0 references
