Proof-theoretic semantics for first-order logic

Abstract Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness in both cases is proved through standard techniques, the proof completeness for CL is complex and somewhat obscure, but clear and simple for IPL. Makinson gave a simplified proof of the completeness of classical propositional logic by directly relating the P-tS to the logic’s extant truth-functional semantics. In this paper, we give an elementary, constructive, and native—in the sense that it does not presuppose the model-theoretic interpretation of classical logic—proof of the completeness of the P-tS of CL using the techniques used for IPL. Simultaneously, we give a proof of soundness and completeness for first-order intuitionistic logic (IL).

Authors

Institutions

Publication Details

Journal
Logic Journal of IGPL
Published
2025-08-15
DOI
https://doi.org/10.1093/jigpal/jzaf062
Citations
1
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Proof-theoretic semantics for first-order logic

Alexander V. Gheorghiu
1 citations
Logic Journal of IGPL
Logic, programming, and type systems
2.48
article

Proof-theoretic semantics for first-order logic

Alexander V. Gheorghiu
article en
1 citations

Abstract

Abstract Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness in both cases is proved through standard techniques, the proof completeness for CL is complex and somewhat obscure, but clear and simple for IPL. Makinson gave a simplified proof of the completeness of classical propositional logic by directly relating the P-tS to the logic’s extant truth-functional semantics. In this paper, we give an elementary, constructive, and native—in the sense that it does not presuppose the model-theoretic interpretation of classical logic—proof of the completeness of the P-tS of CL using the techniques used for IPL. Simultaneously, we give a proof of soundness and completeness for first-order intuitionistic logic (IL).

Logic Journal of IGPLVol. 33(5)
University of Southampton (GB), University College London (GB)
Openalex Percentile: Top 9%
Logic, programming, and type systems
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Proof-theoretic semantics for first-order logic — Alexander V. Gheorghiu · Logic Journal of IGPL (2025) | TGRS Research Map | TGRS