G.E. Minc, "A cut elimination theorem for relevant logics", J. Soviet Math. Vol 6 no 4 (1976), 422--428, translated from Zap. Naucn Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 32 (1972), 90--97. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Review of Heinrich Wansing, Displaying Modal Logic, Kluwer.. - Restall (Correct)
....of the material on the left of the turnstile entails the disjunction of the material on the right. Sequents feature a single kind of punctuation, here the comma, which is interpreted as conjunction on the left and disjunction on the right. Belnap saw (with others, such as Dunn [2] and Mints [4]) that to model interesting intensional logics such as the logic R of relevant implication, more punctuation was necessary. In particular, it seems necessary to have an intensional form of conjunction, along with the extensional conjunction of standard Gentzen systems. The addition of more ....
G. Minc. Cut-elimination theorem in relevant logics. In J. V. Matijasevic and O. A. Silenko, editors, Issledovania po konstructivnoj mathematike i matematiceskoj logike V, pages 90--97. Izdatel'stvo "Nauka", 1972. (English translation in "Cut-Elimination Theorem in Relevant Logics" [5]).
Relevant and Substructural Logics - Restall (2001) (3 citations) Self-citation (Logics) (Correct)
....E, and while giving some separation of the distinct behaviours of the logical connectives, does not provide pure introduction and elimination rules for each connective. For a proof theory which does that, the world would have to wait until the 1970s, and for some independent work of Grigori Minc [195, 197] 32 and J. Michael Dunn [78] 33 The fusion connective # plays a minor role in early work in the Anderson Belnap tradition. 34 They noted that it has some interesting properties in R, but that the residuation connection fails in E if we take A # B to be defined as #(A #B) ....
....by means of finite models. This implementation works in many cases [263] Clearly, work must be done to see whether the horrific complexity of this problem in general can be transferred to results about average case complexity. 2. 7 Richer Structures Gentzen systems for distribution Grigori Minc [195, 197] and J. Michael Dunn [78] independently developed a Gentzen style consecution calculus for relevant logics in the vicinity of R. As we have seen in the Gentzen calculus for R[ the distinctive behaviour of implication arises out of the presence or absence of structural rules governing the ....
G. MINC. "Cut-Elimination Theorem in Relevant Logics". In J. V. MATIJASEVIC AND O. A. SILENKO, editors, Issl edovani a po konstructivnoj mathematik e i matemati ceskoj logike V, pages 90--97. Izdat el'stvo "Nauka", 1972. (English translation in "Cut-Elimination Theorem in Relevant Logics" [196]).
Coherence in Category Theory and the - Church-Rosser Property Barry (Correct)
No context found.
G.E. Minc, "A cut elimination theorem for relevant logics", J. Soviet Math. Vol 6 no 4 (1976), 422--428, translated from Zap. Naucn Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 32 (1972), 90--97.
Relevant and Substructural Logics - Restall (2001) (3 citations) (Correct)
No context found.
G. MINC. "Cut-Elimination Theorem in Relevant Logics". The Journal of Soviet Mathematics, 6:422--428, 1976. (English translation of the original article [195]).
Review of Heinrich Wansing, Displaying Modal Logic, Kluwer.. - Restall (Correct)
No context found.
G. Minc. Cut-elimination theorem in relevant logics. The Journal of Soviet Mathematics, 6:422--428, 1976. (English translation the original article [4]).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC