Predicate
From Maths
Revision as of 18:44, 18 March 2016 by Alec (Talk | contribs) (Created page with "{{Stub page}} ==Definition== A ''predicate'', {{M|P}}, is a 1}}-place relation on a set {{M|X}}<ref group="Note">{{M|P\subseteq X}} in this case....")
(Unknown grade)
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.
Contents
[hide]Definition
A predicate, P, is a 1-place relation on a set X[Note 1].
See also
- Axiom of schema of comprehension - This states that given a set A we can construct a set B such that B={x∈A |P(x)} for some predicate P
Notes
- Jump up ↑ P⊆X in this case. In contrast to a binary relation⊆X×X or an n-place relation⊆X×X×…×X⏟n times
References
- ↑ Jump up to: 1.0 1.1 Types and Programming Languages - Benjamin C. Peirce
|