Cut-elimination theorem for relevant logics

DOI10.1007/BF01084083MaRDI QIDQ1247417zbMATH OpenOpenAlexFDO

Authors G. E. 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)

Cites work

• A Decision Procedure For the System E_Ī of Entailment with Negation
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• Intensional models for first degree formulas
• The pure calculus of entailment

Cited in

(13)

• On purported Gentzen formulations of two positive relevant logics
• A cut-elimination proof in positive relevant logic with necessity
• Hypersequent and display calculi -- a unified perspective
• The original sin of proof-theoretic semantics
• An alternative Gentzenisation of \(\mathsf{RW}_+^\circ\)
• The Lambek calculus extended with intuitionistic propositional logic
• R-Mingle is Nice, and so is Arnon Avron
• A syntactic approach to Maksimova's principle of variable separation for some substructural logics
• Ternary relations and relevant semantics
• An algebraic glimpse at bunched implications and separation logic
• Fusion, fission, and Ackermann's truth constant in relevant logics: a proof-theoretic investigation
• Algorithmic complexity of theories with Kleene iteration
• Infinitary action logic: complexity, models and grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247417)