The computational significance of Hausdorff's maximal chain principle
From MaRDI portal
Publication:2106609
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
Cites work
- A general extension theorem for directed-complete partial orders
- A universal Krull-Lindenbaum theorem
- Axiom of choice
- 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
- Cut elimination for entailment relations
- Dimension de Heitmann des treillis distributifs et des anneaux commutatifs
- Dynamic evaluation of integrity and the computational content of Krull's lemma
- Dynamical method in algebra: Effective Nullstellensätze
- Eliminating disjunctions by disjunction elimination
- Eliminating disjunctions by disjunction elimination
- Graph theory
- Handbook of game theory. Vol. 4
- scientific article; zbMATH DE number 1201510 (Why is no real title available?)
- scientific article; zbMATH DE number 1420837 (Why is no real title available?)
- scientific article; zbMATH DE number 3269866 (Why is no real title available?)
- Induction in algebra: a first case study
- Induction in algebra: a first case study
- Lindenbaum's lemma via open induction
- Making the use of maximal ideals constructive
- Notes on Set Theory
- Proving open properties by induction
- Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem
- Some new intuitionistic equivalents of Zorn's Lemma
- Syntax for semantics: Krull's maximal ideal theorem
- The Hahn-Banach theorem by disjunction elimination
- THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY
- The origin of Zorn's lemma
- The Radical and Semi-Simplicity for Arbitrary Rings
- Zorn's lemma and complete Boolean algebras in intuitionistic type theories
Cited in
(13)- Maximal ideals in countable rings, constructively
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- A universal algorithm for Krull's theorem
- The Jacobson radical for an inconsistency predicate
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
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)
