Higher-order modal logic - A sketch

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

Volumn 1761 LNAI, Issue , 2000, Pages 23-38

  Fitting, Melvin ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; FORMAL METHODS; MACHINERY; SEMANTICS; STARS; THEOREM PROVING;

FIRST ORDER; FORMAL SEMANTICS; HIGHER-ORDER; MODAL LOGIC; NATURAL EXTENSION; PREDICATE ABSTRACTIONS; PROOF PROCEDURES; TABLEAU RULES;

COMPUTER CIRCUITS;

EID: 84867818018     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46508-1_2     Document Type: Conference Paper

References (9)

1. A. Bressan. A General Interpreted Modal Calculus. Yale University Press, 1972.
2. M. C. Fitting. Bertrand Russell, Herbrand's theorem, and the assignment statement. In J. Calmet and J. Plaza, editors, Artificial Intelligence and Symbolic Computation, pages 14-28. Springer Lecture Notes in Artificial Intelligence, 1476, 1998.
3. M. C. Fitting and R. Mendelsohn. First-Order Modal Logic. Kluwer, 1998.
4. K. Gödel. Ontological proof. In S. Feferman, J. W. Dawson, Jr., W. Goldfarb, C. Parsons, and R. M. Solovay, editors, Kurt Gödel Collected Works, volume III, pages 403-404. Oxford, Oxford, 1995.
5. G. E. Hughes and M. J. Cresswell. A New Introduction to Modal Logic. Routledge, London, 1996.
6. D. Prawitz. Hauptsatz for higher order logic. Journal of Symbolic Logic, 33:452-457, 1968.
7. R. Stalnaker and R. Thomason. Abstraction in first-order modal logic. Theoria, 34:203-207, 1968.
8. M. Takahashi. A proof of cut-elimination theorem in simple type theory. J. Math. Soc. Japan, 19:399-410, 1967.
9. R. Thomason and R. Stalnaker. Modality and reference. Nous, 2:359-372, 1968.