Abstract
The axioms and theorems of mathematics are defined on sets such as the set of integers \( Z \). We need to be able to write and manipulate logical formulas that contain relations on values from arbitrary sets. First-order logic is an extension of propositional logic that includes predicates interpreted as relations on a domain.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Fitting. First-Order Logic and Automated Theorem Proving (Second Edition). Springer, 1996.
A. Nerode and R.A. Shore. Logic for Applications (Second Edition). Springer, 1997.
R.M. Smullyan. First-Order Logic. Springer-Verlag, 1968. Reprinted by Dover, 1995.
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: Formulas, Models, Tableaux. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4129-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4129-7_7
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4128-0
Online ISBN: 978-1-4471-4129-7
eBook Packages: Computer ScienceComputer Science (R0)