Resolving finite indeterminacy. A definitive constructive universal prime ideal theorem

DOI10.1145/3373718.3394777MaRDI QIDQ5145683zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

computational contentdynamical prooffinite treegeometric logicinductive generationKrull's lemmanon-deterministic axiomprime idealsproof-theoretic conservation

Mathematics Subject Classification ID

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

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

Cited in

(21)

• Dynamic evaluation of integrity and the computational content of Krull's lemma
• Maximal ideals in countable rings, constructively
• The computational significance of Hausdorff's maximal chain principle
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
• A universal algorithm for Krull's theorem
• Radical theory of Scott-open filters
• A universal Krull-Lindenbaum theorem
• Induction in algebra: a first case study
• The Jacobson radical for an inconsistency predicate
• A general Glivenko-Gödel theorem for nuclei
• Conservation as translation
• 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
• Well quasi-orders, better quasi-orders, and monomial ideals

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)