Resolving finite indeterminacy
From MaRDI portal
Publication:5145683
DOI10.1145/3373718.3394777zbMath1498.03160OpenAlexW3032306896MaRDI QIDQ5145683
Daniel Wessel, Peter M. 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
prime idealsgeometric logicfinite treeinductive generationcomputational contentKrull's lemmaproof-theoretic conservationdynamical proofnon-deterministic axiom
Ideals and multiplicative ideal theory in commutative rings (13A15) Other constructive mathematics (03F65)
Related Items (7)
The Jacobson radical for an inconsistency predicate ⋮ A universal algorithm for Krull's theorem ⋮ Radical theory of Scott-open filters ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ 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
This page was built for publication: Resolving finite indeterminacy
