Abstract
The formulas in first-order logic that we have defined are sufficient to express many interesting properties. Consider, for example, the formula:
Under the interpretation:
it expresses the true statement that the relation less-than is transitive in the domain of the integers. Suppose, now, that we want to express the following statement which is also true in the domain of integers:
The difference between this statement and the previous one is that it uses the function +.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 subscriptionsReferences
M. Fitting. First-Order Logic and Automated Theorem Proving (Second Edition). Springer, 1996.
J.W. Lloyd. Foundations of Logic Programming (Second Edition). Springer, Berlin, 1987.
E. Mendelson. Introduction to Mathematical Logic (Fifth Edition). Chapman & Hall/CRC, 2009.
J.D. Monk. Mathematical Logic. Springer, 1976.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Ben-Ari, M. (2012). First-Order Logic: Terms and Normal Forms. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4129-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4129-7_9
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4128-0
Online ISBN: 978-1-4471-4129-7
eBook Packages: Computer ScienceComputer Science (R0)