Cut-elimination theorem for relevant logics

DOI10.1007/BF01084083zbMath0379.02011OpenAlexW2014579147MaRDI QIDQ1247417

Grigori Mints

Publication date: 1976

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01084083

Mathematics Subject Classification ID

General logic (03B99) Proof theory and constructive mathematics (03F99)

Related Items (11)

The Lambek calculus extended with intuitionistic propositional logic ⋮ Ternary relations and relevant semantics ⋮ An alternative Gentzenisation of RW+∘ ⋮ The original sin of proof-theoretic semantics ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ Infinitary action logic: complexity, models and grammars ⋮ Hypersequent and display calculi -- a unified perspective ⋮ A syntactic approach to Maksimova's principle of variable separation for some substructural logics ⋮ A cut-elimination proof in positive relevant logic with necessity ⋮ R-Mingle is Nice, and so is Arnon Avron ⋮ On purported Gentzen formulations of two positive relevant logics

Cites Work

• The pure calculus of entailment
• A Decision Procedure For the System E_Ī of Entailment with Negation
• Intensional models for first degree formulas
• Unnamed Item

This page was built for publication: Cut-elimination theorem for relevant logics