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}\}$.
J. Symbolic Logic
78(1):
214-236
(March 2013).
DOI: 10.2178/jsl.7801150
ACCESS THE FULL ARTICLE
It is not available for individual sale.
This article is only available to subscribers.
It is not available for individual sale.
It is not available for individual sale.