Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Aransay, Jesús
Ballarin, Clemens
and
Rubio, Julio
2008.
A Mechanized Proof of the Basic Perturbation Lemma.
Journal of Automated Reasoning,
Vol. 40,
Issue. 4,
p.
271.
Coquand, Thierry
Lombardi, Henri
and
Schuster, Peter
2009.
Spectral schemes as ringed lattices.
Annals of Mathematics and Artificial Intelligence,
Vol. 56,
Issue. 3-4,
p.
339.
Coquand, Thierry
2009.
Space of valuations.
Annals of Pure and Applied Logic,
Vol. 157,
Issue. 2-3,
p.
97.
Curi, Giovanni
2010.
On some peculiar aspects of the constructive theory of point‐free spaces.
Mathematical Logic Quarterly,
Vol. 56,
Issue. 4,
p.
375.
PERDRY, HERVÉ
and
SCHUSTER, PETER
2011.
Noetherian orders.
Mathematical Structures in Computer Science,
Vol. 21,
Issue. 1,
p.
111.
Lombardi, H.
2011.
Un anneau de Prüfer.
Actes des rencontres du CIRM,
Vol. 2,
Issue. 2,
p.
59.
Coquand, Thierry
and
Quitté, Claude
2012.
Constructive finite free resolutions.
Manuscripta Mathematica,
Vol. 137,
Issue. 3-4,
p.
331.
Rinaldi, Davide
2012.
A formal proof of the projective Eisenbud–Evans–Storch theorem.
Archiv der Mathematik,
Vol. 99,
Issue. 1,
p.
9.
Schuster, Peter
2012.
Induction in Algebra: A First Case Study.
p.
581.
Rinaldi, Davide
2013.
A constructive notion of codimension.
Journal of Algebra,
Vol. 383,
Issue. ,
p.
178.
Schwichtenberg, Helmut
and
Senjak, Christoph
2013.
Minimal from classical proofs.
Annals of Pure and Applied Logic,
Vol. 164,
Issue. 6,
p.
740.
Coquand, Thierry
2014.
Constructivity and Computability in Historical and Philosophical Perspective.
Vol. 34,
Issue. ,
p.
159.
PERDRY, HERVÉ
and
SCHUSTER, PETER
2014.
Constructing Gröbner bases for Noetherian rings.
Mathematical Structures in Computer Science,
Vol. 24,
Issue. 2,
Rinaldi, Davide
and
Schuster, Peter
2016.
A universal Krull–Lindenbaum theorem.
Journal of Pure and Applied Algebra,
Vol. 220,
Issue. 9,
p.
3207.
Rinaldi, Davide
Sambin, Giovanni
and
Schuster, Peter
2016.
The Basic Zariski Topology.
Confluentes Mathematici,
Vol. 7,
Issue. 1,
p.
55.
RINALDI, DAVIDE
SCHUSTER, PETER
and
WESSEL, DANIEL
2017.
ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION.
The Bulletin of Symbolic Logic,
Vol. 23,
Issue. 2,
p.
181.
Rinaldi, Davide
Schuster, Peter
and
Wessel, Daniel
2018.
Eliminating disjunctions by disjunction elimination.
Indagationes Mathematicae,
Vol. 29,
Issue. 1,
p.
226.
Rinaldi, Davide
and
Wessel, Daniel
2019.
Cut elimination for entailment relations.
Archive for Mathematical Logic,
Vol. 58,
Issue. 5-6,
p.
605.
Berger, Ulrich
2019.
Mathesis Universalis, Computability and Proof.
Vol. 412,
Issue. ,
p.
55.
Brede, Nuria
and
Herbelin, Hugo
2021.
On the logical structure of choice and bar induction principles.
p.
1.