2017
DOI: 10.1007/s11225-017-9772-6
|View full text |Cite
|
Sign up to set email alerts
|

The Naturality of Natural Deduction

Abstract: Developing a suggestion by Russell, Prawitz showed how the usual natural deduction inference rules for disjunction, conjunction and absurdity can be derived using those for implication and the second order quantifier in propositional intuitionistic second order logic NI 2 . It is however well known that the translation does not preserve the relations of identity among derivations induced by the permutative conversions and immediate expansions for the definable connectives, at least when the equational theory o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
52
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(53 citation statements)
references
References 16 publications
0
52
0
Order By: Relevance
“…As suggested in the previous paper (cf. [33] Section 4.3), the results we are concerned with are not limited to the standard intuitionistic connectives, but scale smoothly to a wider class of connectives investigated in proof-theoretic semantics (see e.g. [24,26]).…”
Section: Polynomial Connectivesmentioning
confidence: 89%
See 2 more Smart Citations
“…As suggested in the previous paper (cf. [33] Section 4.3), the results we are concerned with are not limited to the standard intuitionistic connectives, but scale smoothly to a wider class of connectives investigated in proof-theoretic semantics (see e.g. [24,26]).…”
Section: Polynomial Connectivesmentioning
confidence: 89%
“…In this section we introduce a formal framework for natural deduction which extends the one from [33] to a more general class of propositional connectives.…”
Section: Polynomial Connectives and Their Rp-translationmentioning
confidence: 99%
See 1 more Smart Citation
“…The naturality condition appears as a very perspicuous characterization of the uniformity of polymorphic programs, as the latter should correspond to functions over types "that behave in the same way for all types" [40]. Functorial interpretations of typed -calculi and natural deduction (see [2,21]) show that terms (i.e., proofs) correspond to natural transformations, i.e., to uniform families (see [50] for a functorial view of natural deduction within natural deduction itself). §7.…”
Section: Functors and Natural Transformationsmentioning
confidence: 99%
“…He considers this question to be the most fundamental problem of general proof theory. Tranchini, Pistone and Petrolo [23] show that the Russell-Prawitz translation of firstinto second-order logic preserves identity of proof with respect to a certain enriched system. Piecha and Schroeder-Heister [15] show that intuitionistic propositional logic is incomplete with respect to standard notions of prooftheoretic validity.…”
mentioning
confidence: 99%