1.Previous
3.Next

in first-order logic is obtained by taking the function f to be the unique function so that is the two-element set holding the values true and false, a subset S is that subset for which the predicate holds, and
:
:which is true if is not empty, and
:which is false if S is not X.

The universal and existential quantifiers given above generalize to the presheaf category.

See also

1.Previous
3.Next