Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem

DOI10.1145/3373718.3394777zbMATH Open1498.03160OpenAlexW3032306896MaRDI QIDQ5145683FDOQ5145683

Daniel Wessel, Peter Schuster

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373718.3394777

Recommendations

• A universal algorithm for Krull's theorem
• Dynamical method in algebra: Effective Nullstellensätze
• Dynamic evaluation of integrity and the computational content of Krull's lemma
• A universal Krull-Lindenbaum theorem
• Induction in algebra: a first case study

zbMATH Keywords

geometric logicprime idealsfinite treeinductive generationcomputational contentKrull's lemmaproof-theoretic conservationdynamical proofnon-deterministic axiom

Mathematics Subject Classification ID

Other constructive mathematics (03F65) Ideals and multiplicative ideal theory in commutative rings (13A15)

Cited In (8)

• Maximal ideals in countable rings, constructively
• The computational significance of Hausdorff's maximal chain principle
• A universal algorithm for Krull's theorem
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
• A general Glivenko-Gödel theorem for nuclei
• The Jacobson radical for an inconsistency predicate
• Radical theory of Scott-open filters
• Dynamic evaluation of integrity and the computational content of Krull's lemma

This page was built for publication: Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem

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