Sets in Coq, Coq in Sets

This work is about formalizing models of various type theories of the Calculus of Constructions family. Here we focus on set theoretical models. The long-term goal is to build a formal set theoretical model of the Calculus of Inductive Constructions, so we can be sure that Coq is consistent with the language used by most mathematicians. One aspect of this work is to axiomatize several set theories: ZF possibly with inaccessible cardinals, and HF, the theory of hereditarily finite sets. On top of these theories we have developped a piece of the usual set theoretical construction of functions, ordinals and fixpoint theory. We then proved sound several models of the Calculus of Constructions, its extension with an infinite hierarchy of universes, and its extension with the inductive type of natural numbers where recursion follows the type-based termination approach. The other aspect is to try and discharge (most of) these assumptions. The goal here is rather to compare the theoretical strengths of all these formalisms. As already noticed by Werner, the replacement axiom of ZF in its general form seems to require a type-theoretical axiom of choice (TTAC).

[1]  Mark-Oliver Stehr,et al.  Programming, specification, and interactive theorem proving : towards a unified language based on equational logic, rewriting logic, and type theory , 2002 .

[2]  Eugenio Moggi,et al.  Constructive Natural Deduction and its 'Omega-Set' Interpretation , 1991, Math. Struct. Comput. Sci..

[3]  Andreas Abel,et al.  Type-based termination: a polymorphic lambda-calculus with sized higher-order types , 2006 .

[4]  Thierry Coquand,et al.  Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory , 2008 .

[5]  Eduardo Giménez,et al.  Structural Recursive Definitions in Type Theory , 1998, ICALP.

[6]  Paul Taylor,et al.  Intuitionistic sets and ordinals , 1996, Journal of Symbolic Logic.

[7]  Eduardo Giménez,et al.  Codifying Guarded Definitions with Recursive Schemes , 1994, TYPES.

[8]  John Harrison,et al.  Towards Self-verification of HOL Light , 2006, IJCAR.

[9]  Nikolaj Bjørner,et al.  Proofs and Refutations, and Z3 , 2008, LPAR Workshops.

[10]  Benjamin Werner,et al.  The Not So Simple Proof-Irrelevant Model of CC , 2002, TYPES.

[11]  Deepak Kapur,et al.  Lemma Discovery in Automated Induction , 1996, CADE.

[12]  Harvey M. Friedman,et al.  The consistency of classical set theory relative to a set theory with intu1tionistic logic , 1973, Journal of Symbolic Logic.

[13]  Martin Protzen,et al.  Lazy Generation of Induction Hypotheses , 1994, CADE.

[14]  Henry A. Kautz,et al.  Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..

[15]  Michaël Rusinowitch,et al.  Incorporating Decision Procedures in Implicit Induction , 2001, J. Symb. Comput..

[16]  Robin Adams.  Pure type systems with judgemental equality , 2006, J. Funct. Program..

[17]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[18]  Alan Bundy,et al.  The Automation of Proof by Mathematical Induction , 1999, Handbook of Automated Reasoning.

[19]  Alexandre Miquel,et al.  lamda-Z: Zermelo's Set Theory as a PTS with 4 Sorts , 2004, TYPES.

[20]  Harvey M. Friedman,et al.  The lack of definable witnesses and provably recursive functions in intuitionistic set theories , 1985 .

[21]  Martin Penicka,et al.  Formal Approach to Railway Applications , 2007, Formal Methods and Hybrid Real-Time Systems.

[22]  Herman Geuvers,et al.  A Simple Model Construction for the Calculus of Constructions , 1995, TYPES.

[23]  Andreas Abel,et al.  Towards Normalization by Evaluation for the βη-Calculus of Constructions , 2022 .

[24]  Hasan Amjad,et al.  Efficiently checking propositional refutations in HOL theorem provers , 2009, J. Appl. Log..

[25]  Sorin Stratulat,et al.  Validation of the JavaCard Platform with Implicit Induction Techniques , 2003, RTA.

[26]  Zhaohui Luo,et al.  ECC, an extended calculus of constructions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[27]  Michal Moskal,et al.  Rocket-Fast Proof Checking for SMT Solvers , 2008, TACAS.

[28]  Alan Bundy,et al.  A Survey of Automated Deduction , 1999, Artificial Intelligence Today.

[29]  Zhaohui Luo.  An extended calculus of constructions , 1990 .

[30]  Andreas Abel.  Towards Normalization by Evaluation for the betaeta-Calculus of Constructions , 2010, FLOPS.

[31]  Benjamin Werner,et al.  Sets in Types, Types in Sets , 1997, TACS.

[32]  P. Aczel,et al.  Notes on constructive set theory , 1997 .

[33]  Claus-Peter Wirth,et al.  History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie! , 2005, Mechanizing Mathematical Reasoning.

[34]  J. A. Robinson,et al.  Logic: Form and function - The Mechanization of Deductive Reasoning , 1979 .

[35]  Filip Maric,et al.  Formalization and Implementation of Modern SAT Solvers , 2009, Journal of Automated Reasoning.

[36]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[37]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.