Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Nerode, Anil
1990.
Logic and Computer Science.
Vol. 1429,
Issue. ,
p.
12.
Lipton, James
1992.
Constructivity in Computer Science.
Vol. 613,
Issue. ,
p.
22.
Lipton, James
1992.
Logic from Computer Science.
Vol. 21,
Issue. ,
p.
319.
Lipton, James
and
O'Donnell, Michael J.
1994.
Mathematical Foundations of Computer Science 1994.
Vol. 841,
Issue. ,
p.
87.
Gallier, Jean
1995.
Proving properties of typed λ-terms using realizability, covers, and sheaves.
Theoretical Computer Science,
Vol. 142,
Issue. 2,
p.
299.
Moerdijk, Ieke
and
Palmgren, Erik
2000.
Wellfounded trees in categories.
Annals of Pure and Applied Logic,
Vol. 104,
Issue. 1-3,
p.
189.
Aczel, Peter
and
Gambino, Nicola
2002.
Types for Proofs and Programs.
Vol. 2277,
Issue. ,
p.
1.
Avigad, Jeremy
2004.
Forcing in Proof Theory.
Bulletin of Symbolic Logic,
Vol. 10,
Issue. 3,
p.
305.
Gambino, Nicola
2006.
Heyting-valued interpretations for Constructive Set Theory.
Annals of Pure and Applied Logic,
Vol. 137,
Issue. 1-3,
p.
164.
Palmgren, Erik
2007.
A constructive and functorial embedding of locally compact metric spaces into locales.
Topology and its Applications,
Vol. 154,
Issue. 9,
p.
1854.
Gambino, Nicola
2008.
The associated sheaf functor theorem in algebraic set theory.
Annals of Pure and Applied Logic,
Vol. 156,
Issue. 1,
p.
68.
Curi, Giovanni
2010.
On some peculiar aspects of the constructive theory of point‐free spaces.
Mathematical Logic Quarterly,
Vol. 56,
Issue. 4,
p.
375.
van den Berg, Benno
and
Moerdijk, Ieke
2012.
Derived rules for predicative set theory: An application of sheaves.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 10,
p.
1367.
Barušs, Imants
and
Woodrow, Robert
2013.
A Reduction Theorem for the Kripke–Joyal Semantics: Forcing Over an Arbitrary Category can Always be Replaced by Forcing Over a Complete Heyting Algebra.
Logica Universalis,
Vol. 7,
Issue. 3,
p.
323.
Blechschmidt, Ingo
and
Schuster, Peter
2024.
Reifying dynamical algebra: Maximal ideals in countable rings, constructively.
Computability,
p.
1.