On the decidability of implicational ticket entailment
DOI10.2178/jsl.7801150zbMath1275.03159OpenAlexW2156168582MaRDI QIDQ4916555
Katalin Bimbó, J. Michael Dunn
Publication date: 23 April 2013
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1358951110
decidabilitysequent calculinon-associativityrelevance logicsticket entailmentAckermann constantsadmissibility of cut
Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- New consecution calculi for \(R^{t}_{\to}\)
- Types of I-free hereditary right maximal terms
- Admissibility of cut in LC with fixed point combinator
- Logic, meaning and computation. Essays in memory of Alonzo Church
- \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs
- Combinators and structurally free logic
This page was built for publication: On the decidability of implicational ticket entailment