New consecution calculi for R^t_

DOI10.1215/00294527-1722719MaRDI QIDQ691126zbMATH OpenOpenAlexFDO

Authors Katalin Bimbó, J. Michael Dunn

Publication date 29 November 2012

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.ndjfl/1352383228

zbMATH Keywords

relevance logicssequent calculiticket entailmentAckermann constantsadmissibility of cut

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cut-elimination and normal-form theorems (03F05) Decidability of theories and sets of sentences (03B25) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• On the decidability of implicational ticket entailment
• \(TW_+\) and \(RW_+\) are decidable
• A cut-free sequent calculus for relevant logic RW
• scientific article; zbMATH DE number 1248086
• scientific article; zbMATH DE number 1941930

Cites work

• scientific article; zbMATH DE number 3926879 (Why is no real title available?)
• scientific article; zbMATH DE number 3496099 (Why is no real title available?)
• scientific article; zbMATH DE number 3504935 (Why is no real title available?)
• scientific article; zbMATH DE number 3525100 (Why is no real title available?)
• scientific article; zbMATH DE number 3614740 (Why is no real title available?)
• scientific article; zbMATH DE number 596497 (Why is no real title available?)
• scientific article; zbMATH DE number 1028818 (Why is no real title available?)
• scientific article; zbMATH DE number 1984514 (Why is no real title available?)
• scientific article; zbMATH DE number 1749198 (Why is no real title available?)
• A Decision Procedure For the System E_Ī of Entailment with Negation
• Admissibility of cut in LC with fixed point combinator
• Begründung einer strengen Implikation
• Combinators and structurally free logic
• Combinatory logic. Vol. II
• Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment
• Generalized Galois logics. Relational semantics of nonclassical logical calculi
• New consecution calculi for \(R^{t}_{\to}\)
• On the decidability of implicational ticket entailment
• Sentential constants in R and \(R^{\neg}\)
• TRANSIENT SOLUTION OF A ONE-DIMENSIONAL THERMOELASTIC WAVE PROPAGATION PROBLEM
• The first axiomatization of relevant logic
• The undecidability of entailment and relevant implication
• Towards a semantic characterization of cut-elimination
• Types of I-free hereditary right maximal terms
• Untersuchungen über das logische Schliessen. I
• \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs

Cited in

(13)

• New consecution calculi for \(R^{t}_{\to}\)
• Issues in machine-checking the decidability of implicational ticket entailment
• From Hilbert proofs to consecutions and back
• \(TW_+\) and \(RW_+\) are decidable
• Types of I-free hereditary right maximal terms
• Larisa Maksimova’s Early Contributions to Relevance Logic
• An alternative Gentzenisation of \(\mathsf{RW}_+^\circ\)
• IN MEMORIAM: J. MICHAEL DUNN, 1941–2021
• Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment
• Current trends in substructural logics
• On the decidability of implicational ticket entailment
• scientific article; zbMATH DE number 2024615 (Why is no real title available?)
• A cut-elimination proof in positive relevant logic with necessity

This page was built for publication: New consecution calculi for \(R^{t}_{\to}\)

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