Ticket Entailment is decidable
Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Padovani, Vincent
Institution: Laboratory Preuves, Programmes et Systèmes
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4300360378