Predicate¶
Core Idea¶
A predicate is a testable yes-or-no property of an object — a function to a truth value that draws a sharp boundary across a domain of candidates, sorting every one to one side or the other.
How would you explain it like I'm…
The Yes-or-No Question
A Predicate is a yes-or-no question you can ask about something, like 'Is this apple red?' The answer is either yes or no — nothing in between. It sorts everything into two piles: the yeses and the nos.
The Pass-or-Fail Test
A Predicate is a test that gives a clean yes or no about something. 'Is this number even?' is a Predicate: every number is either even or not, with no maybe. The big deal is that a yes-or-no test lets you do things a fuzzy description can't. You can split everything into two groups, count how many pass, and apply one rule to the passers and another to the rest. Going from 'this is kind of big' to 'this either passes the test or it doesn't' is what makes sorting and rule-following actually work.
The True-or-False Boundary
A Predicate is a testable yes-or-no property of an object, or a relation among objects — formally a function from one or more inputs to a truth value, true or false, with no third option. The whole content is a sharp boundary drawn over the space of candidates: a Predicate is exactly a rule that sorts every candidate to one side or the other. That sharpness buys operations a loose description cannot: every Predicate partitions its domain into satisfiers and non-satisfiers, and lets you count them, index them, send each side to different handling, combine Predicates with AND/OR/NOT, and quantify ('for all,' 'there exists'). It also has negation closure: the negation of a Predicate is itself a Predicate, with complementary satisfier-sets — the backbone of case analysis ('does P hold or not-P?') and proof by contradiction.
A Predicate is a testable yes-or-no property of an object, or relation among objects — formally, a function from one or more arguments to a truth value; operationally, a question 'does x satisfy P?' whose answer is true or false, with no third option in the formal case and explicit handling required in the practical one. The structural commitment is a sharp boundary between yes and no drawn over the space of candidate objects; that boundary is the whole content. What Predicates buy that loose descriptions do not is a host of derived operations flowing from the truth-valued signature: every Predicate partitions its argument domain into satisfiers and non-satisfiers, and licenses counting, indexing, dispatching different handling to each side, Boolean combination with other Predicates, and quantification over the domain. The move from an informally described attribute to a decidable test — from 'roughly so-and-so' to 'passes or does not' — is what makes classification, rule-following, indexing, and inference work. Predicates also support negation closure: the negation of a Predicate is itself a Predicate, with complementary satisfier-sets, the structural backbone of case analysis, indirect proof, and legal, diagnostic, and policy dichotomies. Because the signature is purely logical, the Predicate is substrate-neutral — the same structure governs a clinical criterion, a database filter, an eligibility rule, and a type check.
Broad Use¶
- Logic and mathematics: first-order logic and set-builder notation define a set as the extension of a predicate.
- Computing: a query's filter clause is a predicate over rows; type checks and assertions are predicates evaluated at runtime.
- Law and policy: eligibility rules are predicates — does this applicant satisfy the residency-and-income-and-age conjunction?
- Medicine: clinical criteria for a diagnosis (fever above a threshold, cough beyond a duration) are predicates combined by Boolean rule.
- Engineering: acceptance criteria and tolerance bands are predicates evaluated on each unit.
- Linguistics and philosophy: a verb phrase predicates a property of a subject; predication is the foundational logical act.
Clarity¶
Makes a design question askable — what is the test, exactly? — and distinguishes two failures with opposite fixes: vagueness (fuzzy boundary) wants sharper criteria, underdetermination (inaccessible facts) wants decidable inputs.
Manages Complexity¶
Compresses an entire decision-process to one question and supports deferred evaluation: a fixed test, defined once, applied uniformly to an unbounded stream of objects.
Abstract Reasoning¶
Grounds reasoning about extension versus intension, quantification, decidability, and Boolean closure — the satisfier-set and the defining criterion as dual faces of one object.
Knowledge Transfer¶
- Logic to law: enumerating quantifier scopes transfers to drafting eligibility rules without unintended coverage.
- Software to regulation: predicates-as-types exports as layered review where each input must satisfy explicit, named tests.
- Law to algorithms: contesting vague predicates like "reasonable" transfers to debates over fairness predicates in automated systems.
Example¶
Write S = { n ∈ ℕ : n is prime }: ℕ is the domain, "is prime" the truth-valued test, S the extension; negation and conjunction build new predicates from it, and quantifiers turn it into propositions about the satisfier-set.
Relationships to Other Primes¶
Parents (1) — more general patterns this builds on
- Predicate is a kind of Relation — The file: 'a predicate is a ONE-PLACE relation, a relation is a multi-place predicate.' A (one-place) predicate is the unary special case of a relation; relation is the genus.
Children (1) — more specific cases that build on this
- Quantifier presupposes Predicate — The file: 'A predicate is the PROPERTY a quantifier scopes; without a quantifier it is a fragment with no truth value.' A quantifier operates on a predicate over a domain to fix scope and produce a proposition — it presupposes a predicate. predicate is a candidate (this batch, CAND-R2-072-10).
Path to root: Predicate → Relation
Not to Be Confused With¶
- Predicate is not a Relation because a one-place predicate tests a property of a single object, whereas a relation is the multi-place case holding among several objects.
- Predicate is not a Quantifier because a predicate is a fragment with no truth value until its scope is fixed, whereas a quantifier supplies that scope.
- Predicate is not a Constraint because a predicate merely tests and returns true or false, whereas a constraint restricts admissible states and must be satisfied.