Cargando…
The Computational Significance of Hausdorff’s Maximal Chain Principle
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 con...
Autores principales: | Schuster, Peter, Wessel, Daniel |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7309501/ http://dx.doi.org/10.1007/978-3-030-51466-2_21 |
Ejemplares similares
-
Hausdorff approximations
por: Beer, Gerald
Publicado: (1990) -
On the Hausdorff-Young theorem
por: Nasserddine, W
Publicado: (2005) -
Hausdorff gaps and limits
por: Frankiewicz, Ryszard, et al.
Publicado: (1994) -
Extensions and absolutes of Hausdorff spaces
por: Porter, Jack R, et al.
Publicado: (1988) -
Non-Hausdorff topology and domain theory
por: Goubault-Larrecq, Jean
Publicado: (2013)