The computational significance of Hausdorff's maximal chain principle (Q2106609)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational significance of Hausdorff's maximal chain principle |
scientific article; zbMATH DE number 7633512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational significance of Hausdorff's maximal chain principle |
scientific article; zbMATH DE number 7633512 |
Statements
The computational significance of Hausdorff's maximal chain principle (English)
0 references
16 December 2022
0 references
axiom of choice
0 references
maximal chain
0 references
maximal ideal
0 references
maximal clique
0 references
Jacobson radical
0 references
proof-theoretic conservation
0 references
computational content
0 references
constructive set theory
0 references
finite binary tree
0 references
inductive generation
0 references
0 references
0 references
0 references
0.84090984
0 references
0.8332112
0 references
0.8328059
0 references
0.83085847
0 references
0 references
0.8246391
0 references
0.82455325
0 references
0.8242528
0 references
