Predicates and Propositional Functions
What You'll Learn
You'll discover how predicates transform static propositions into flexible, variable-dependent statements that can express properties and relationships.
From Fixed to Flexible Truth
So far, you've worked with propositions—statements that are simply true or false, like "5 is odd" or "Paris is in France." These have fixed truth values.
A predicate (or propositional function) is different: it's a statement that contains one or more variables and becomes a proposition only when you substitute specific values for those variables. Think of it as a function that outputs truth values instead of numbers.
Understanding Predicates
Consider the statement: "x is greater than 10"
This isn't a proposition yet—we can't say it's true or false until we know what x is. We write this as P(x): "x > 10"
- If x = 15, then P(15) is true
- If x = 3, then P(3) is false
The predicate P(x) is like a truth-value machine: feed it an input, get back true or false.
Multi-Variable Predicates
Predicates can have multiple variables:
Q(x, y): "x + y = 7"
- Q(3, 4) is true
- Q(2, 2) is false
Key Distinction
Unlike simple propositions that are always true or always false, predicates:
- Contain variables
- Have no truth value until variables are assigned specific values
- Act as functions mapping inputs to {true, false}
- Form the foundation for expressing mathematical properties, relationships, and general statements about entire domains
Key Takeaway: Predicates are functions that return truth values based on variable inputs, transforming logic from static statements into flexible tools for expressing patterns and relationships across entire sets of objects.