The computational significance of Hausdorff's maximal chain principle

DOI10.1007/978-3-030-51466-2_21OpenAlexW3037614249MaRDI QIDQ2106609

Peter M. Schuster, Daniel Wessel

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_21

zbMATH Keywords

maximal chainmaximal idealJacobson radicalaxiom of choiceconstructive set theorymaximal cliqueinductive generationcomputational contentfinite binary treeproof-theoretic conservation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

The Jacobson radical for an inconsistency predicate ⋮ A universal algorithm for Krull's theorem ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ Maximal ideals in countable rings, constructively

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A universal Krull-Lindenbaum theorem
• Handbook of game theory. Vol. 4
• Proving open properties by induction
• The origin of Zorn's lemma
• Some new intuitionistic equivalents of Zorn's Lemma
• Eliminating disjunctions by disjunction elimination
• Dynamic evaluation of integrity and the computational content of Krull's lemma
• The Hahn-Banach theorem by disjunction elimination
• Cut elimination for entailment relations
• Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
• Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
• Making the use of maximal ideals constructive
• Induction in Algebra: a First Case Study
• Induction in Algebra: A First Case Study
• Lindenbaum’s Lemma via Open Induction
• Notes on Set Theory
• Dimension de Heitmann des treillis distributifs et des anneaux commutatifs
• Zorn's lemma and complete Boolean algebras in intuitionistic type theories
• A General Extension Theorem for Directed-Complete Partial Orders
• Syntax for Semantics: Krull’s Maximal Ideal Theorem
• THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY
• Resolving finite indeterminacy
• ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION
• The Radical and Semi-Simplicity for Arbitrary Rings
• Axiom of choice
• Dynamical method in algebra: Effective Nullstellensätze

This page was built for publication: The computational significance of Hausdorff's maximal chain principle