Proof-theoretic Semantics for Second-order Logic
By: Alexander V. Gheorghiu, David J. Pym
Potential Business Impact:
Makes logic rules work without needing big math.
We develop a proof-theoretic semantics (P-tS) for second-order logic (S-oL), providing an inferentialist alternative to both full and Henkin model-theoretic interpretations. Our approach is grounded in base-extension semantics (B-eS), a framework in which meaning is determined by inferential roles relative to atomic systems -- collections of rules that encode an agent's pre-logical inferential commitments. We show how both classical and intuitionistic versions of S-oL emerge from this set-up by varying the class of atomic systems. These systems yield modular soundness and completeness results for corresponding Hilbert-style calculi, which we prove equivalent to Henkin's account of S-oL. In doing so, we reframe second-order quantification as systematic substitution rather than set-theoretic commitment, thereby offering a philosophically lightweight yet expressive semantics for higher-order logic. This work contributes to the broader programme of grounding logical meaning in use rather than reference and offers a new lens on the foundations of logic and mathematics.
Similar Papers
Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
Logic
Makes logic rules work like a mirror.
A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
Logic in Computer Science
Makes computer logic more efficient and understandable.
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.