Journal of Philosophical Logic 34 (5/6):607 - 620 (2005)

Katalin Bimbo
University of Alberta
The implicational fragment of the relevance logic "ticket entailment" is closely related to the so-called hereditary right maximal terms. I prove that the terms that need to be considered as inhabitants of the types which are theorems of $T_\rightarrow$ are in normal form and built in all but one casefrom B, B' and W only. As a tool in the proof ordered term rewriting systems are introduced. Based on the main theorem I define $FIT_\rightarrow$ - a Fitch-style calculus (related to $FT_\rightarrow$ ) for the implicational fragment of ticket entailment
Keywords combinatory logic  decidability  λ-calculus  natural deduction  relevance logic  simple types  term rewriting
Categories (categorize this paper)
DOI 10.1007/s10992-005-2831-x
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,617
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

View all 7 references / Add more references

Citations of this work BETA

Combinatory Logic.Katalin Bimbó - 2009 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles


Added to PP index

Total views
21 ( #472,666 of 2,348,790 )

Recent downloads (6 months)
1 ( #512,546 of 2,348,790 )

How can I increase my downloads?


My notes