The computational significance of Hausdorff's maximal chain principle
type: Item
instance of: scholarly article
title: The computational significance of Hausdorff's maximal chain principle
DOI: 10.1007/978-3-030-51466-2_21
author: Peter Schuster
author: Daniel Wessel
publication date: 2022-12-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7633512
zbMATH Keywords: axiom of choice
zbMATH Keywords: maximal chain
zbMATH Keywords: maximal ideal
zbMATH Keywords: maximal clique
zbMATH Keywords: Jacobson radical
zbMATH Keywords: proof-theoretic conservation
zbMATH Keywords: computational content
zbMATH Keywords: constructive set theory
zbMATH Keywords: finite binary tree
zbMATH Keywords: inductive generation
MaRDI profile type: Publication
full work available at URL: 978-3-030-51466-2 21
OpenAlex ID: W3037614249
cites work: Zorn's lemma and complete Boolean algebras in intuitionistic type theories
cites work: Some new intuitionistic equivalents of Zorn's Lemma
cites work: Q5422499
cites work: The origin of ''Zorn's lemma''
cites work: Q4944905
cites work: Lindenbaum’s Lemma via Open Induction
cites work: Dimension de Heitmann des treillis distributifs et des anneaux commutatifs
cites work: Dynamical method in algebra: Effective Nullstellensätze
cites work: Q5554961
cites work: THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY
cites work: Axiom of choice
cites work: Q4210469
cites work: The Radical and Semi-Simplicity for Arbitrary Rings
cites work: Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
cites work: Notes on Set Theory
cites work: Proving open properties by induction
cites work: A universal Krull-Lindenbaum theorem
cites work: ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
cites work: Eliminating disjunctions by disjunction elimination
cites work: Cut elimination for entailment relations
cites work: The Hahn-Banach theorem by disjunction elimination
cites work: Induction in Algebra: A First Case Study
cites work: Induction in algebra: a first case study
cites work: Syntax for Semantics: Krull’s Maximal Ideal Theorem
cites work: A General Extension Theorem for Directed-Complete Partial Orders
cites work: Resolving finite indeterminacy
cites work: Dynamic evaluation of integrity and the computational content of Krull's lemma
cites work: Making the use of maximal ideals constructive
cites work: Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
cites work: Handbook of game theory. Vol. 4
Recommended article: Computing maximal chains
Recommended article: On the computational content of the Bolzano-Weierstraß Principle
Recommended article: Computational Aspects of Hamburger’s Theorem
Recommended article: Higman’s Lemma and Its Computational Content
Recommended article: COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
Recommended article: Maximal chains in the Turing degrees
Recommended article: Computational aspects of the Hausdorff distance in unbounded dimension
Recommended article: Advantages of the Hausdorff centered measure from the computability point of view
Recommended article: On the complexity of computing the Hausdorff distance
description: scientific article; zbMATH DE number 7633512