The computational significance of Hausdorff's maximal chain principle

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

Authors: Peter Schuster, Daniel Wessel 

Publication date: 16 December 2022

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

Recommendations

• Computing maximal chains
• On the computational content of the Bolzano-Weierstraß Principle
• Computational aspects of Hamburger's theorem
• Higman's lemma and its computational content
• COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
• Maximal chains in the Turing degrees
• Computational aspects of the Hausdorff distance in unbounded dimension
• Advantages of the Hausdorff centered measure from the computability point of view
• On the complexity of computing the Hausdorff distance

zbMATH Keywords

maximal idealaxiom of choiceJacobson radicalmaximal cliquemaximal chainconstructive set theoryinductive generationcomputational contentfinite binary treeproof-theoretic conservation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Graph theory
• Proving open properties by induction
• A universal Krull-Lindenbaum theorem
• Induction in algebra: a first case study
• Lindenbaum's lemma via open induction
• Notes on Set Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of game theory. Vol. 4
• The Radical and Semi-Simplicity for Arbitrary Rings
• Axiom of choice
• Title not available (Why is that?)
• Making the use of maximal ideals constructive
• Dynamical method in algebra: Effective Nullstellensätze
• Dimension de Heitmann des treillis distributifs et des anneaux commutatifs
• 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
• Induction in algebra: a first case study
• Eliminating disjunctions by disjunction elimination
• Eliminating disjunctions by disjunction elimination
• Zorn's lemma and complete Boolean algebras in intuitionistic type theories
• The origin of Zorn's lemma
• A general extension theorem for directed-complete partial orders
• Some new intuitionistic equivalents of Zorn's Lemma
• Dynamic evaluation of integrity and the computational content of Krull's lemma
• Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem
• The Hahn-Banach theorem by disjunction elimination
• Cut elimination for entailment relations
• Syntax for semantics: Krull's maximal ideal theorem
• THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106609)