second-order predicate calculus
Quick Summary
The second-order predicate calculus is an extension of the first-order predicate calculus that allows for quantification over predicate variables in addition to individual variables. This means it can express statements about properties and relations themselves, not just about individuals. For example, it can express the idea that "every property has at least one instance".12
In contrast, the first-order predicate calculus, also known as the lower predicate calculus, only permits quantification over individual variables. This distinction is fundamental in formal logic, with higher-order calculi being more expressive but also leading to incompleteness, as proven by Kurt Gödel.23
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

