The Relative Consistency of the Axiom of Choice - Mechanized Using Isabelle/ZF
暂无分享,去创建一个
[1] Art Quaife,et al. Automated deduction in von Neumann-Bernays-Gödel set theory , 1992, Journal of Automated Reasoning.
[2] Lawrence C. Paulson,et al. Proving properties of security protocols by induction , 1997, Proceedings 10th Computer Security Foundations Workshop.
[3] Kenneth Kunen,et al. Set Theory: An Introduction to Independence Proofs , 2010 .
[4] Sidney G. Winter,et al. Naive Set Theory , 2021, Essential Mathematics for Undergraduates.
[5] P. Cameron. Naïve set theory , 1998 .
[6] Lawrence C. Paulson,et al. A fixedpoint approach to (co)inductive and (co)datatype definitions , 2000, Proof, Language, and Interaction.
[7] Johan G. F. Belinfante,et al. On Computer-Assisted Proofs in Ordinal Number Theory , 1999, Journal of Automated Reasoning.
[8] Krzysztof Grabczewski,et al. Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of Choice , 2001, ArXiv.
[9] Piotr Rudnicki,et al. A Compendium of Continuous Lattices in MIZAR , 2003, Journal of Automated Reasoning.
[10] Lawrence C. Paulson,et al. The Reflection Theorem: A Study in Meta-theoretic Reasoning , 2002, CADE.
[11] Lawrence C. Paulson,et al. Set theory for verification. II: Induction and recursion , 1995, Journal of Automated Reasoning.
[12] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .
[13] Lawrence Charles Paulson,et al. Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .
[14] Lawrence C. Paulson,et al. Mechanizing set theory , 1996, Journal of Automated Reasoning.
[15] Lawrence C. Paulson,et al. The foundation of a generic theorem prover , 1989, Journal of Automated Reasoning.
[16] Florian Kammüller,et al. Locales - A Sectioning Concept for Isabelle , 1999, TPHOLs.
[17] Elliott Mendelson,et al. Introduction to Mathematical Logic , 1979 .
[18] K. Gödel. Consistency-Proof for the Generalized Continuum-Hypothesis. , 1939, Proceedings of the National Academy of Sciences of the United States of America.
[19] de Ng Dick Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[20] K. Gödel. The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis. , 1938, Proceedings of the National Academy of Sciences of the United States of America.
[21] D. Prawitz. Ideas and Results in Proof Theory , 1971 .
[22] Martin Strecker,et al. Formal Verification of a Java Compiler in Isabelle , 2002, CADE.
[23] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .
[24] J. Urban. Basic Facts about Inaccessible and Measurable Cardinals , 2004 .
[25] de Ng Dick Bruijn,et al. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[26] Lawrence C. Paulson,et al. Set theory for verification: I. From foundations to functions , 1993, Journal of Automated Reasoning.
[27] Lawrence Charles Paulson. The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf , 2021, 2104.12674.