An algorithmic version of Zariski's lemma
From MaRDI portal
Publication:2117812
DOI10.1007/978-3-030-80049-9_46zbMATH Open1489.14006OpenAlexW3186402499MaRDI QIDQ2117812FDOQ2117812
Authors: Franziskus Wiesnet 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_46
Recommendations
Other constructive mathematics (03F65) Algebraic field extensions (12F05) Elementary questions in algebraic geometry (14A25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proofs and Computations
- A course in constructive algebra
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Title not available (Why is that?)
- Commutative algebra: constructive methods. Finite projective modules. Translated from the French by Tania K. Roblot
- A new proof of Hilbert’s Nullstellensatz
- Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
- An algorithmic approach to the existence of ideal objects in commutative algebra
- PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
- Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
- Elementare Algebraische Geometrie
- A Note on Zariski's Lemma
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: An algorithmic version of Zariski's lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117812)
