Abstract
The first step in giving a formal account of first order logic (for which excellent introductory textbooks are due to Mendelson [1978] and van Dalen [1982]) is of course to specify, in a rigorous way, a language for it since, as indicated in Section 2.1, a language is required if a logic is to be defined. There exist infinitely many languages for first order logic, all of them sharing the same core set of special symbols and rules of construction of formulas. The set of symbols (an alphabet) that a first order language employs is as follows.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Besnard, P. (1989). First Order Logic. In: An Introduction to Default Logic. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05689-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-05689-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08078-4
Online ISBN: 978-3-662-05689-9
eBook Packages: Springer Book Archive