Article contents
Ticket Entailment is decidable
Published online by Cambridge University Press: 09 July 2012
Abstract
We prove the decidability of the logic T→ of Ticket Entailment. This issue was first raised by Anderson and Belnap within the framework of relevance logic, and 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.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2012
References
- 7
- Cited by