On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics

Journal of Logic and Computation 31 (1):213-265 (2021)
Download Edit this record How to cite View on PhilPapers
This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled calculi, such as completeness, invertibility of rules and cut admissibility. Since labelled calculi are easily obtained via a logic’s semantics, the method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favourable properties are derived directly from a logic’s semantics.
PhilPapers/Archive ID
Upload history
Archival date: 2021-04-07
View other versions
Added to PP index

Total views
50 ( #61,406 of 68,997 )

Recent downloads (6 months)
17 ( #43,537 of 68,997 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.