A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
The Computational Significance of Hausdorff's Maximal Chain Principle
[chapter]
2020
Lecture Notes in Computer Science
As a fairly frequent form of the Axiom of Choice about relatively simple structures (posets), Hausdorff's Maximal Chain Principle appears to be little amenable to computational interpretation. This received view, however, requires revision. When attempting to convert Hausdorff's principle into a conservation theorem, we have indeed found out that maximal chains are more reminiscent of maximal ideals than it might seem at first glance. The latter live in richer algebraic structures (rings), and
doi:10.1007/978-3-030-51466-2_21
fatcat:m7ios446cfeahni63eorjtsaem