First - Order reasoning in the calculus of inductive constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3085, Issue , 2004, Pages 162-177

  Corbineau, Pierre ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); THEOREM PROVING;

CALCULUS OF INDUCTIVE CONSTRUCTIONS; COQ PROOF ASSISTANT; CUT ELIMINATION; INDUCTIVE DEFINITIONS; INTUITIONISTIC LOGIC; NATURAL EXTENSION; PROOF SEARCH; SEQUENT CALCULUS;

CALCULATIONS;

EID: 26944441421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24849-1_11     Document Type: Article

References (14)

1. G. Beilin and J. Ketonen. A decision procedure revisited: Notes on direct logic, linear logic and its implementation. Theoretical computer science, 95(1):115-142, 1992.
2. The Coq Development Team (INRIA-LRI-CNRS). The Coq proof assistant reference manual. http://coq.inria.fr
3. D. Delahaye. A tactic language for the system Coq. In Proceedings of Logic for Programming and Automated Reasoning, volume 1955 of LNCS/LNAI, pages 8595. Springer, 2000.
4. A. G. Dragalin. Mathematical Intuitionism: Introduction to Proof Theory, volume 67 of Translations of Mathematical Monographs. American Mathematical Society, Providence, Rhode Island, 1987.
5. R. Dyckhoff. Contraction - free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 57(3):795-807, 1992.
6. R. Dyckhoff and S. Negri. Admissibility of structural rules for contraction - free systems of intuitionistic logic. Journal of Symbolic Logic, 65:1499-1518, 2000.
7. J.-C. Filliâtre. A decision procedure for direct predicate calculus: study and implementation in the Coq system. Technical Report 96-25, LIP, ENS Lyon, 1995.
8. J.Ketonen and R.Weyhrauch. A decidable fragment of predicate calculus. Theoretical Computer Science, 32:297-307, 1984.
9. S. C. Kleene. Introduction to metamathematics, volume I of Bibliotheca Mathematica. North - Holland, Amsterdam, 1952.
10. C. Kreitz. The Nuprl Proof Development System, Version 5, 2002. http://wwu.cs.Cornell.edu/Info/Projects/NuPrl/
11. C. Kreitz and J. Otten. Connection - based theorem proving in classical and nonclassical logics. Journal of Universal Computer Science, 5(3):88-112, 1999.
12. C. Munoz. Démonstration automatique dans la logique propositionnelle intuitionniste. Master's thesis, Université Paris 7, 1994.
13. C. Paulin - Mohring. Inductive definitions in the system Coq: Rules and properties. In M. Bezem and J. F. Groote, editors, TLCA'93, Utrecht, The Netherlands, 16-18 March 1993, volume 664 of LNCS, pages 328-345, Berlin, 1993. Springer - Verlag.
14. S. Schmitt, L. Lorigo, C. Kreitz, and A. Nogin. Integrating connection - based theorem proving into interactive proof assistants. In R. Gore, A. Leitsch, and T. Nipkow, editors, IJCAR'01, volume 2083 of LNAI, pages 421-426. Springer, 2001.