Formalizing basic first order model theory

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

Volumn 1479, Issue , 1998, Pages 153-170

  Harrison, John ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTICS;

DATA TYPE; FIRST ORDER LOGIC; FIRST-ORDER MODELS; META-THEOREMS; MODEL THEORY; SATISFIABILITY; SKOLEMIZATION;

THEOREM PROVING;

EID: 84947727835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055135     Document Type: Conference Paper

References (14)

1. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae, 34, 381-392, 1972.
2. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.
3. A. D. Gordon and T. Melham. Five axioms of alpha-conversion. In J. von Wright, J. Grundy, and J. Harrison (eds.), Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96, Volume 1125 of Lecture Notes in Computer Science, Turku, Finland, pp. 173-190. Springer-Verlag, 1996.
4. M. J. C. Gordon and T. F. Melham. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
5. P. T. Johnstone. Notes on Logic and Set Theory. Cambridge University Press, 1987.
6. G. Kreisel and J.-L. Krivine. Elements of mathematical logic: model theory (Revised second ed.). Studies in Logic and the Foundations of Mathematics. North-Holland, 1971. First edition 1967. Translation of the French 'Eléments de logique mathematique, theorie des modeles' published by Dunod, Paris in 1964.
7. T. F. Melham. The HOL logic extended with quantification over type variables. In L. J. M. Claesen. and M. J. C. Gordon, (eds.), Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications, Volume A-20 of IFIP Transactions A: Computer Science and Technology, IMEC, Leuven, Belgium, pp. 3-18. North-Holland, 1992.
8. H. Persson. Constructive Completeness of Intuitionistic Predicate Logic: A For-malisation in Type Theory. Licentiate thesis, Department of Computing Science, Chalmers University of Technology and University of Goteborg, Sweden, 1996.
9. R. Pollack. The theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. Ph. D. thesis, University of Edinburgh, 1994.
10. D. Prawitz. Natural deduction; a proof-theoretical study, Volume 3 of Stockholm Studies in Philosophy. Almqvist and Wiksells, 1965.
11. P. Rudnicki. An overview of the MIZAR project, 1992. Available by anonymous FTP from menaik.cs.ualberta.ca as pub/Mizar/Mizar.Over.tar.Z.
12. S. Shapiro. Foundations without Foundationalism: A case for second-order logic. Number 17 in Oxford Logic Guides. Clarendon Press, 1991.
13. A. Stoughton. Substitution revisited. Theoretical Computer Science, 17, 317-325, 1988.
14. A. Trybulec. The Mizar-QC/6000 logic information language. ALLC Bulletin (Association for Literary and Linguistic Computing), 6, 136-140, 1978.