Math 2.0

Mathematical logic and foundations Definition

Predicate

Builds on Proposition

Definition

Let XX be a set. A predicate on XX is a statement P(x)P(x) with a variable xx that ranges over XX, such that P(a)P(a) is a proposition for each a∈Xa \in X. More generally, a predicate P(x1,…,xn)P(x_1, \dots, x_n) has nn variables, and nn is its arity.

Remarks

The predicate "x>3x > 3" on the integers gives the true proposition "5>35 > 3" and the false proposition "1>31 > 3". A predicate on XX determines the set {x∈X∣P(x)}\{x \in X \mid P(x)\} of the values that make it true. See set-builder notation. A predicate with two variables is a binary relation.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proposition concept
  2. Predicate definition

Where this leads

1079 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Predicate_(logic), lead section
About this page
Tag0T3DPBG981
URIm2://0T3DPBG981
Kinddefinition
WritingW1 stated
MSC03B10
DefinesPredicate
UsesProposition

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by