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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
G. Gentzen. The Collected Papers of Gerhard Gentzen. North-Holland, 1969.
S. C. Kleene. Introduction to metamathematics. North-Holland, Amsterdam, 1952.
D. Prawitz. Natural Deduction: A Proof-theoretical Study. Almquist and Wiksell, 1965.
Author information
Authors and Affiliations
Editor information
Additional information
This paper is dedicated to Professor Takasu for his dedication to science and his recognition that logic is important both for program correctness and theories of reasoning.
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Weyhrauch, R.W., Talcott, C. (1994). The logic of FOL systems: Formulated in set theory. In: Jones, N.D., Hagiya, M., Sato, M. (eds) Logic, Language and Computation. Lecture Notes in Computer Science, vol 792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032398
Download citation
DOI: https://doi.org/10.1007/BFb0032398
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57935-9
Online ISBN: 978-3-540-48391-5
eBook Packages: Springer Book Archive