Ticket Entailment is decidable

Details Ticket Entailment is decidable Ticket Entailment is decidable

2011-06-09

arxiv.org/abs/1106.1875v5

Computer Science

Logic in Computer Science

Submitted on 06/09/2010 to Math. Struct. in Comp. Science. Accepted for publication on 12/19/2011. Last revision on 03/06/2012

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Ticket Entailment is decidable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ticket Entailment is decidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ticket Entailment is decidable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-580863