Combining type theory and untyped set theory

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

Volumn 4130 LNAI, Issue , 2006, Pages 205-219

  Brown, Chad E ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PROBLEM SOLVING; THEOREM PROVING;

MAC LANE SET THEORY; PARTIAL FUNCTIONS;

SET THEORY;

EID: 33749557168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_19     Document Type: Conference Paper

References (22)

1. Andreas Abel, Thierry Coquand, and Ulf Norell. Connecting a logical framework to a first-order logic prover. In Bernhard Gramlich, editor, 5th International Workshop on Frontiers of Combining Systems, FroCoS'05, Vienna, Austria, September 19-21, 2005, Lecture Notes in Computer Science, 2005.
2. Peter B. Andrews and Matthew Bishop. On sets, types, fixed points, and checkerboards. In Pierangelo Miglioli, Ugo Moscato, Daniele Mundici, and Mario Ornaghi, editors, Theorem Proving with Analytic Tableaux and Related Methods. 5th International Workshop. (TABLEAUX '96), volume 1071 of Lecture Notes in Artificial Intelligence, pages 1-15, Terrasini, Italy, May 1996. Springer-Verlag.
3. Peter B. Andrews, Matthew Bishop, and Chad E. Brown. System description: TPS: A theorem proving system for type theory. In David McAllester, editor, Proceedings of the 17th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Artificial Intelligence, pages 164-169, Pittsburgh, PA, USA, 2000. Springer-Verlag.
4. Arnon Avron. Formalizing set theory as it is actually used. In Andrea Asperti, Grzegorz Bancerek, and Andrzej Trybulec, editors, MKM, volume 3119 of Lecture Notes in Computer Science, pages 32-43. Springer, 2004.
5. J.G.F. Belinfante. Computer Proofs in Gödel's class theory with equational definitions for composite and cross. Journal of Automated Reasoning, 22:311-339, 1999.
6. Robert Boyer, Ewing Lusk, William McCune, Ross Overbeek, Mark Stickel, and Lawrence Wos. Set theory in first-order logic: Clauses for Gödel's axioms. Journal of Automated Reasoning, 2:287-327, 1986.
7. Domenico Cantone, Calogero G. Zarba, and Rosa Ruggeri-Cannata. A tableaubased decision procedure for a fragment of set theory1 with iterated membership. Journal of Automated Reasoning, 34(1):49-72, 2005.
8. Gilles Dowek. Collections, sets and types. Mathematical Structures in Computer Science, 9(1):109-123, 1999.
9. William M. Farmer. Stmm: A set theory for mechanized mathematics. J. Autom. Reasoning, 26(3):269-289, 2001.
10. Michael J. C. Gordon. Set theory, higher order logic or both? In Joakim von Wright, Jim Grundy, and John Harrison, editors, TPHOLs, volume 1125 of Lecture Notes in Computer Science, pages 191-201. Springer, 1996.
11. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
12. J. Lambek and P. Scott. Introduction to Higher Order Categorial Logic. Cambridge University Press, Cambridge, UK, 1986.
13. Saunders Mac Lane. Mathematics, Form and Function. Springer-Verlag, 1986.
14. Jia Meng. Integration of interactive and automatic provers. In Manuel Carro and Jesus Correas, editors, Second CologNet Workshop on Implementation Technology for Computational Logic Systems, 2003. http://www.cl.cam.ac.uk/users/ jm318/papers/integration.pdf.
15. Bengt Nordström, Kent Petersson, and Jan Smith. Martin-löf's type theory. In Samson Abramsky et al., editors, Handbook of Logic in Computer Science, volume 5. Oxford University Press, 2000.
16. Lawrence C. Paulson. Set Theory for Verification: II. Induction and Recursion. Journal of Automated Reasoning, 15(2):167-215, 1995.
17. Frank Pfenning and Garsten Schürmann. System Description: Twelf-A MetaLogical Framework for Deductive Systems. In Harald Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction, volume 1632 of Lecture Notes in Artificial Intelligence, pages 202-206, Trento, Italy, 1999. Springer-Verlag.
18. Art Quaife. Automated Development of Fundamental Mathematical Theories. Kluwer Academic Publishers, Norwell, MA, USA, 1992.
19. Jason Reed. Proof irrelevance and strict definitions in a logical framework. Technical Report 02-153, School of Computer Science, Carnegie Mellon University, 2002.
20. A. Riazanov and A. Voronkov. Vampire 1.1. (system description). In Rajeev Gore, Alexander Leitsch, and Tobias Nipkow, editors, Automated Reasoning, First International Joint Conference, IJCAR, volume LNAI 2083 of Lecture Notes in Artificial Intelligence, pages 376-380, Siena, Italy, January 2001. Springer Verlag.
21. Raymond Turner. Type inference for set theory. Theor. Comput. Sci., 266(1-2):951-974, 2001.
22. Freek Wiedijk. Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics. Journal of Applied Logic, 4, 2006. to appear.