Abstract
The logic of predicates encompasses much of the reasoning in the mathematical sciences. We are already familiar with the informal idea of a property holding of an object or a relation holding between objects. Any such property or relation is an example of a predicate. The difference between a property and a relation is just in the arity of the predicate. Unary predicates are simply properties of objects, binary ones are relations between pairs of objects and in general n-ary predicates express relations among n-tuples of objects. A reasonable answer to the question of what are 0-ary predicates might well be that they are propositions. The point here is that they are simply statements of facts independent of any variables. Thus, for example, if we are discussing the natural numbers we may let φ(x, y) denote the binary relation (predicate) “x is less than y”. In this case φ(3, y) denotes the property (unary predicate) of y “3 is less than y” and φ(3, 4) denotes the (true) proposition (0-ary predicate) that 3 is less than 4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Nerode, A., Shore, R.A. (1993). Predicate Logic. In: Logic for Applications. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0211-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-0211-7_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-0213-1
Online ISBN: 978-1-4684-0211-7
eBook Packages: Springer Book Archive