In set theory, Easton's theorem is a result on the possible cardinal numbers of powersets. W. B. Easton (1970) (extending a result of Robert M. Solovay) showed via forcing that <math> \kappa < \operatorname{cf}(2^\kappa)\,</math> and, for <math> \kappa < \lambda\,</math>, that <math> 2^\kappa\le 2^\lambda\,</math> are the only constraints on permissible values for 2 when κ is a regular cardinal.
| Property | Value |
|---|
| dbpprop:abstract
|
- In set theory, Easton's theorem is a result on the possible cardinal numbers of powersets. W. B. Easton (1970) (extending a result of Robert M. Solovay) showed via forcing that <math> \kappa < \operatorname{cf}(2^\kappa)\,</math> and, for <math> \kappa < \lambda\,</math>, that <math> 2^\kappa\le 2^\lambda\,</math> are the only constraints on permissible values for 2 when κ is a regular cardinal.
|
| dbpprop:hasPhotoCollection
| |
| dbpprop:relatedInstance
| |
| rdfs:comment
|
- In set theory, Easton's theorem is a result on the possible cardinal numbers of powersets. W. B. Easton (1970) (extending a result of Robert M. Solovay) showed via forcing that <math> \kappa < \operatorname{cf}(2^\kappa)\,</math> and, for <math> \kappa < \lambda\,</math>, that <math> 2^\kappa\le 2^\lambda\,</math> are the only constraints on permissible values for 2 when κ is a regular cardinal.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
![[RDF Data]](/statics/sw-cube.png)
