Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
CrossRef.
Manolios, Panagiotis
and
Vroon, Daron
2005.
Ordinal Arithmetic: Algorithms and Mechanization.
Journal of Automated Reasoning,
Vol. 34,
Issue. 4,
p.
387.
Arvind
Dave, Nirav
and
Katelman, Michael
2008.
FM 2008: Formal Methods.
Vol. 5014,
Issue. ,
p.
12.
Paulson, Lawrence C.
2008.
Logic and Theory of Algorithms.
Vol. 5028,
Issue. ,
p.
486.
Shankar, Natarajan
2009.
Automated deduction for verification.
ACM Computing Surveys,
Vol. 41,
Issue. 4,
p.
1.
Harrison, John
Urban, Josef
and
Wiedijk, Freek
2014.
Computational Logic.
Vol. 9,
Issue. ,
p.
135.
Paulson, Lawrence C.
2015.
A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle.
Journal of Automated Reasoning,
Vol. 55,
Issue. 1,
p.
1.
Paulson, Lawrence C.
2018.
Computational logic: its origins and applications.
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences,
Vol. 474,
Issue. 2210,
p.
20170872.
Paulson, Lawrence C.
Nipkow, Tobias
and
Wenzel, Makarius
2019.
From LCF to Isabelle/HOL.
Formal Aspects of Computing,
Vol. 31,
Issue. 6,
p.
675.
Gunther, Emmanuel
Pagano, Miguel
and
Terraf, Pedro Sánchez
2019.
First Steps Towards a Formalization of Forcing.
Electronic Notes in Theoretical Computer Science,
Vol. 344,
Issue. ,
p.
119.
Sun, Tianyu
and
Yu, Wensheng
2020.
A Formal System of Axiomatic Set Theory in Coq.
IEEE Access,
Vol. 8,
Issue. ,
p.
21510.
Gunther, Emmanuel
Pagano, Miguel
and
Sánchez Terraf, Pedro
2020.
Automated Reasoning.
Vol. 12167,
Issue. ,
p.
221.