An algorithmic version of Zariski's lemma

DOI10.1007/978-3-030-80049-9_46zbMath1489.14006OpenAlexW3186402499MaRDI QIDQ2117812

Franziskus Wiesnet

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_46

zbMATH Keywords

program extractioncomputational algebraproof miningconstructive algebraZariski's lemma

Mathematics Subject Classification ID

Algebraic field extensions (12F05) Other constructive mathematics (03F65) Elementary questions in algebraic geometry (14A25)

Related Items (2)

The Jacobson radical for an inconsistency predicate ⋮ Radical theory of Scott-open filters

Uses Software

• Minlog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A course in constructive algebra
• An algorithmic approach to the existence of ideal objects in commutative algebra
• 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
• Elementare Algebraische Geometrie
• Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
• Proofs and Computations
• A Note on Zariski's Lemma
• PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• A new proof of Hilbert’s Nullstellensatz

This page was built for publication: An algorithmic version of Zariski's lemma