This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
2B.A. Davey and H.A. Priestley , Introduction to lattices and order (Cambridge University Press, 1990).
4Kurt Gödel , ‘The consistency of the axiom of choice and of the generalized continuum hypothesis’,  26–27; first published in Proc. Nat. Acad. Sci.USA (1938) 556–557.
11Tobias Nipkow , Lawrence C. Paulson and Markus Wenzel , Isabelle⁄HOL: a proof assistant for higher-order logic, Lecture Notes in Comput. Sci. Tutorial 2283 (Springer, 2002).
12Lawrence C. Paulson , ‘The foundation of a generic theorem prover‘, J. Automat. Reasoning 5 (1989) 363–397.
13Lawrence C. Paulson , ‘Set theory for verification: I. From foundations to functions‘, J. Automat. Reasoning 11 (1993) 353–389.
15Lawrence C. Paulson , ‘Set theory for verification: II. Induction and recursion’ J. Automat. Reasoning 15 (1995) 167–215.
16Lawrence C. Paulson , ‘Proving properties of security protocols by induction‘, 10th Computer Security Foundations Workshop (IEEE Computer Society Press, 1997) 70–83.
18Lawrence C. Paulson , ‘The reflection theorem: a study in meta-theoretic reasoning’,  377–391.
19Lawrence C. Paulson and Krzysztof Grąbczewski , ‘Mechanizing set theory:cardinal arithmetic and the axiom of choice’, J. Automat. Reasoning 17 (1996) 291–323.
21Martin Strecker , ‘Formal verification of a Java compiler in Isabelle’,  63–77.
22Andrei Voronkov , ed. Automated deduction – CADE-18 International Conference, Lecture Notes in Artificial Intelligence 2392 (Springer, 2002).