2012
DOI: 10.1007/s11225-012-9417-8
|View full text |Cite
|
Sign up to set email alerts
|

Natural Deduction for Dual-intuitionistic Logic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
7
0
3

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(10 citation statements)
references
References 15 publications
0
7
0
3
Order By: Relevance
“…Recent work in co-intuitionistic and bi-intuitionistic proof theory (starting from the notes in appendix to Prawitz [25]) exploits the formal symmetry between intuitionistic conjunction and implication, on one hand, and co-intuitionistic disjunction and subtraction, on the other, in various formalisms, the sequent calculus, as in Czermak [11] and Urbas [32], the display calculus by Goré [16] or natural deduction by Uustalu [33], see also [24]. Luca Tranchini [31] shows how to turn Prawitz Natural Deduction trees upside down, as it was done also by the first author in [5,2,6], who has also developed a computational interpretation and a categorical semantics for co-intuitionistic linear logic [6,4].…”
Section: No Categorical Bi-intuitionistic Theory Of Proofsmentioning
confidence: 99%
“…Recent work in co-intuitionistic and bi-intuitionistic proof theory (starting from the notes in appendix to Prawitz [25]) exploits the formal symmetry between intuitionistic conjunction and implication, on one hand, and co-intuitionistic disjunction and subtraction, on the other, in various formalisms, the sequent calculus, as in Czermak [11] and Urbas [32], the display calculus by Goré [16] or natural deduction by Uustalu [33], see also [24]. Luca Tranchini [31] shows how to turn Prawitz Natural Deduction trees upside down, as it was done also by the first author in [5,2,6], who has also developed a computational interpretation and a categorical semantics for co-intuitionistic linear logic [6,4].…”
Section: No Categorical Bi-intuitionistic Theory Of Proofsmentioning
confidence: 99%
“…Обратим внимание, что свойство T * (C 2 ) = T * (M ) есть матрич-ный вариант свойства α L ⊥ ⇐⇒ α CL ⊥, которое имеет место в интуиционистской логике Int и выступает следствием из известной теоремы Гливенко [57], [56]. Само же утверждение теоремы встреча-ется в литературе в двух вариантах: Int ¬¬α ⇐⇒ CL α [45, p. 391] и Int ¬α ⇐⇒ CL ¬α [29], [56].…”
unclassified
“…Само же утверждение теоремы встреча-ется в литературе в двух вариантах: Int ¬¬α ⇐⇒ CL α [45, p. 391] и Int ¬α ⇐⇒ CL ¬α [29], [56]. Покажем, что при обоих форму-лировках аналог теоремы доказуем для C-расширяющих матриц из…”
unclassified
See 1 more Smart Citation
“…Wolter (1998) employs→ as his connective of coimplication, but this notation seems not to have received a wide support. Starting with Goré (2000) − has gained increasing popularity (see, e.g., Pinto & Uustalu, 2010;Wansing, 2010;Tranchini, 2012), although as (Schroeder-Heister, 2009, p.1084 observes, it was already used in (Bochenski & Menne, 1962). In this paper, this symbol is reversed for reasons explained in the next footnote.…”
mentioning
confidence: 99%