Second-Order Predicate¶
A predicate whose argument position ranges over a first-order predicate, concept, relation, or set rather than only over individual objects.
Core Idea¶
A second-order predicate takes a first-order predicate, concept, set, or relation as an argument. In Frege's example, ‘is not satisfied’ applies to the concept ‘is a Bosnian philosopher,’ not to an individual. Frege's example ‘There are no Bosnian philosophers’ can be analyzed as saying of the concept ‘is a Bosnian philosopher’ that it has no satisfiers. Frege's example ‘There are no Bosnian philosophers’ can be analyzed as saying of the concept ‘is a Bosnian philosopher’ that it has no satisfiers.
Scope of Application¶
The notion applies in Fregean logic, second-order logic, semantics, foundations, and analyses of existence or cardinality predicated of concepts. Use it in Fregean and second-order logic only after typing argument positions, distinguishing order from arity, and stating the semantics under which predicates or relations form the higher-order range.
- Concept predication. Attributes satisfaction to a first-level concept.
- Second-order logic. Quantifies over predicates and relations.
- Foundations. Analyzes number and concept extensions.
- Formal semantics. Types higher-order operators.
- Logic education. Separates order from predicate arity.
Clarity¶
To classify an expression, type every variable and argument. ‘Loves(x,y)’ is first order despite two places; ‘F has no instances’ is second order when F ranges over first-level concepts. Surface grammar alone is unreliable. The closest near miss sets the boundary: A higher-arity first-order predicate is the closest near miss: it has several individual slots but no predicate-valued slot.
Manages Complexity¶
Level typing prevents individual, concept, and property-of-concept claims from being conflated. It also exposes the stronger expressive and semantic commitments incurred when a theory quantifies over predicates. The central expressive power–semantic commitment tradeoff is this: Quantifying over predicates expresses generality while requiring a range of higher-order values. A second level distinction–object-language convenience tension matters because Reifying concepts simplifies notation while risking type collapse. The surface grammar–logical form tension adds that Natural sentences hide the argument level.
Abstract Reasoning¶
Use three linked moves: identify the expression's predicate and every argument position; determine whether each variable ranges over individuals or over predicates/relations; translate the proposition without reifying a concept as an ordinary object unless the framework permits it. As a collapse test, the case exits when every variable ranges only over individuals in the first-order domain. A fourth check is to state the semantics governing the higher-order range. A final check is to check whether an equivalent first-order encoding changes ontology or expressive force.
Knowledge Transfer¶
The type-level distinction transfers across logic and typed computation. Everyday phrases such as ‘a property of properties’ are only analogous until their argument types and application rules are formalized. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. A first-level predicate is treated as an input-bearing conceptual object. Argument level prevents concepts and individuals from being substituted indiscriminately.
Relationships to Other Abstractions¶
Current abstraction Second-Order Predicate Domain-specific
Parents (1) — more general patterns this builds on
-
Second-Order Predicate is a kind of Predicate Prime
Second-Order Predicate is a domain-specific kind of predicate under the frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.
Neighborhood in Abstraction Space¶
Second-Order Predicate sits in a crowded region of the domain-specific corpus (23rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Logical Inference, Modality & Conditional Structures (27 abstractions)
Nearest neighbors
- Modus ponens — 0.91
- Cambridge change — 0.90
- Principal type — 0.90
- Propositional logic — 0.90
- Logical possibility — 0.89
Computed from structural-signature embeddings · 2026-10-08