Translator Disclaimer
March 2013 On the decidability of implicational ticket entailment
Katalin Bimbó, J. Michael Dunn
J. Symbolic Logic 78(1): 214-236 (March 2013). DOI: 10.2178/jsl.7801150

Abstract

The implicational fragment of the logic of relevant implication, $R_\to$ is known to be decidable. We show that the implicational fragment of the logic of ticket entailment, $T_\to$ is decidable. Our proof is based on the consecution calculus that we introduced specifically to solve this 50-year old open problem. We reduce the decidability problem of $T_\to$ to the decidability problem of $R_\to$. The decidability of $T_\to$ is equivalent to the decidability of the inhabitation problem of implicational types by combinators over the base $\{\mathsf{B, B', I, W}\}$.

Citation

Download Citation

Katalin Bimbó. J. Michael Dunn. "On the decidability of implicational ticket entailment." J. Symbolic Logic 78 (1) 214 - 236, March 2013. https://doi.org/10.2178/jsl.7801150

Information

Published: March 2013
First available in Project Euclid: 23 January 2013

zbMATH: 1275.03159
MathSciNet: MR3087072
Digital Object Identifier: 10.2178/jsl.7801150

Subjects:

Rights: Copyright © 2013 Association for Symbolic Logic

JOURNAL ARTICLE
23 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.78 • No. 1 • March 2013
Back to Top