An algorithmic version of Zariski's lemma
From MaRDI portal
Publication:2117812
Recommendations
Cites work
- scientific article; zbMATH DE number 193903 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- A Note on Zariski's Lemma
- A course in constructive algebra
- A new proof of Hilbert’s Nullstellensatz
- A simple proof of Zariski's lemma
- An algorithmic approach to the existence of ideal objects in commutative algebra
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- 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
- PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
- Proofs and computations
Cited in
(7)- A simple proof of Zariski's lemma
- A universal algorithm for Krull's theorem
- A version of Zabrodsky’s lemma
- The Jacobson radical for an inconsistency predicate
- Radical theory of Scott-open filters
- An algorithmic version of the blow-up lemma
- scientific article; zbMATH DE number 1824111 (Why is no real title available?)
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)