Ticket Entailment is decidable
Logic in Computer Science
2012-07-06 v6
Abstract
We prove the decidability of Ticket Entailment. Raised by Anderson and Belnap within the framework of relevance logic, this question is equivalent to the question of the decidability of type inhabitation in simply-typed combinatory logic with the partial basis BB'IW. We solve the equivalent problem of type inhabitation for the restriction of simply-typed lambda-calculus to hereditarily right-maximal terms.
Cite
@article{arxiv.1106.1875,
title = {Ticket Entailment is decidable},
author = {Vincent Padovani},
journal= {arXiv preprint arXiv:1106.1875},
year = {2012}
}
Comments
Submitted on 06/09/2010 to Math. Struct. in Comp. Science. Accepted for publication on 12/19/2011. Last revision on 03/06/2012