Solving for set variables in higher-order theorem proving

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

Volumn 2392, Issue , 2002, Pages 408-422

  Brown, Chad E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FIXED POINT ARITHMETIC; FORMAL LOGIC;

HIGHER ORDER LOGIC; HIGHER-ORDER THEOREM PROVING; KNASTER-TARSKI FIXED POINT THEOREMS; LOGICAL FORMULAS; LOGICAL STRUCTURE; MONOTONE SET FUNCTIONS; RECURSIVE DEFINITIONS; SET VARIABLES;

THEOREM PROVING;

EID: 84948951404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_33     Document Type: Conference Paper

References (21)

1. Peter B. Andrews. On connections and higher-order logic. Journal of Automated Reasoning, 5:257–291, 1989.
2. Peter B. Andrews. Classical type theory. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 15, pages 965–1007. Elsevier Science, 2001.
3. Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16:321–353, 1996.
4. Sidney C. Bailin and Dave Barker-Plummer. Z-match: An inference rule for incrementally elaborating set instantiations. Journal of Automated Reasoning, 11:391–428, 1993. Errata: JAR 12 (1994), 411–412.
5. F. Bartels, A. Dold, F. W. v. Henke, H. Pfeifer, and H. Rueß. Formalizing Fixed- Point Theory in PVS. Ulmer Informatik-Berichte 96-10, Universität Ulm, Fakultät für Informatik, 1996.
6. Christoph Benzmüller and Michael Kohlhase. System description: LEO—a higherorder theorem prover. In Claude Kirchner and Hélène Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction, volume 1421 of Lecture Notes in Artificial Intelligence, pages 139–143, Lindau, Germany, 1998. Springer-Verlag.
7. Wolfgang Bibel. Matings in matrices. Communications of the ACM, 26:844–852, 1983.
8. W. W. Bledsoe. A maximal method for set variables in automatic theorem proving. In J. E. Hayes, Donald Michie, and L. I. Mikulich, editors, Machine Intelligence 9, pages 53–100. Ellis Harwood Ltd., Chichester, and John Wiley & Sons, 1979.
9. W. W. Bledsoe and Guohui Feng. Set-Var. Journal of Automated Reasoning, 11:293–314, 1993.
10. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.
11. Amy Felty. Proof search with set variable instantiation in the calculus of constructions. In M. A. McRobbie and J. K. Slaney, editors, Automated Deduction: CADE-13, volume 1104 of Lecture Notes in Artificial Intelligence, pages 658–672. Springer, 1996.
12. Amy Felty. The calculus of constructions as a framework for proof search with set variable instantiation. Theoretical Computer Science, 232:187–229, 2000.
13. J. H. Geuvers. The calculus of constructions and higher order logic. In Ph. de Groote, editor, The Curry-Howard Isomorphism, pages 139–191. Academia, Louvain-la-Neuve (Belgium), 1995.
14. Sunil Issar. Operational Issues in Automated Theorem Proving Using Matings. PhD thesis, Carnegie Mellon University, 1991. 147 pp.
15. B. Knaster. Une théorème sur les fonctions d’ensembles. Annales Soc. Polonaise Math., 6:133–134, 1927.
16. Dale A. Miller. A compact representation of proofs. Studia Logica, 46(4):347–370, 1987.
17. Neil V. Murray and Erik Rosenthal. Dissolution: Making paths vanish. Journal of the ACM, 40(3):504–535, July 1993.
18. H. J. Ohlbach. SCAN—elimination of predicate quantifiers. In M. A. McRobbie and J. K. Slaney, editors, Automated Deduction: CADE-13, volume 1104 of Lecture Notes in Artificial Intelligence, pages 161–165. Springer, 1996.
19. Lawrence C. Paulson. A fixedpoint approach to implementing (co)inductive definitions. In Alan Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, pages 148–161, Nancy, France, June 1994. Springer-Verlag LNAI 814.
20. Lawrence C. Paulson. Set theory for verification: II. Induction and recursion. Journal of Automated Reasoning, 15(2):167–215, 1995.
21. Lawrence C. Paulson. Mechanizing coinduction and corecursion in higher-order logic. Journal of Logic and Computation, 7(2):175–204, March 1997.