Extension (predicate logic)

The extension of a predicate – a truth-valued function – is the set of tuples of values that, used as arguments, satisfy the predicate. Such a set of tuples is a relation.

For example, the statement "d2 follows the weekday d1" can be seen as a truth function associating to each tuple (d2, d1) the value true or false. The extension of this truth function is, by convention, the set of all such tuples associated with the value true, i.e.

{(Monday, Sunday),
 (Tuesday, Monday),
 (Wednesday, Tuesday),
 (Thursday, Wednesday),
 (Friday, Thursday),
 (Saturday, Friday),
 (Sunday, Saturday)}

By examining this extension, we can conclude that "Tuesday follows the weekday Saturday" (for example) is false.

Using set-builder notation, the extension of the n-ary predicate Φ {\displaystyle \Phi } can be written as

{ ( x 1 , . . . , x n ) ∣ Φ ( x 1 , . . . , x n ) } . {\displaystyle \{(x_{1},...,x_{n})\mid \Phi (x_{1},...,x_{n})\}\,.}

If the values 0 and 1 in the range of a characteristic function are identified with the values false and true, respectively – making the characteristic function a predicate – , then for all relations R and predicates Φ {\displaystyle \Phi } the following two statements are equivalent:

• Φ {\displaystyle \Phi } is the characteristic function of R
• R is the extension of Φ {\displaystyle \Phi }

• Extensional logic
• Extensional set
• Extensionality
• Intension

• extension (semantics) in nLab

This logic-related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e

This mathematical logic-related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e