Advertisement

The logic of FOL systems: Formulated in set theory

  • Richard W. Weyhrauch
  • Carolyn Talcott
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 792)

Abstract

In this paper we use set theory to describe FOL systems. This restatement of the notions implicit in First Order Logic facilitates their interpretation as finite data structures. This is a crucial step toward the goal of building an artificial reasoner.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Feferman. Non-extensional type-free theories of partial operations and classifications, i. In J. Diller and G. H. Müller, editors, Proof theory symposium, Kiel 1974, Number 500 in Lecture notes in mathematics, pages 73–118. Springer, Berlin, 1975.Google Scholar
  2. 2.
    G. Gentzen. The Collected Papers of Gerhard Gentzen. North-Holland, 1969.Google Scholar
  3. 3.
    S. C. Kleene. Introduction to metamathematics. North-Holland, Amsterdam, 1952.Google Scholar
  4. 4.
    D. Prawitz. Natural Deduction: A Proof-theoretical Study. Almquist and Wiksell, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Richard W. Weyhrauch
    • 1
    • 2
  • Carolyn Talcott
    • 1
    • 2
  1. 1.IBUKIJapan
  2. 2.Stanford

Personalised recommendations