Abstract
The logic of predicate 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 apredicate. 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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nerode, A., Shore, R.A. (1997). Predicate Logic. In: Logic for Applications. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0649-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0649-1_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6855-0
Online ISBN: 978-1-4612-0649-1
eBook Packages: Springer Book Archive