Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 3
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    SCHMITZ, SYLVAIN 2016. IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE. The Journal of Symbolic Logic, Vol. 81, Issue. 02, p. 641.


    Bimbó, Katalin 2015. Current Trends in Substructural Logics. Journal of Philosophical Logic, Vol. 44, Issue. 6, p. 609.


    2014. Proof Theory.


    ×
  • Mathematical Structures in Computer Science, Volume 23, Issue 3
  • June 2013, pp. 568-607

Ticket Entailment is decidable

  • VINCENT PADOVANI (a1)
  • DOI: http://dx.doi.org/10.1017/S0960129512000412
  • Published online: 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.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

J. Barwise (ed.) (1977) Handbook of Mathematical Logic, Studies in Logic and Foundations of Mathematics, North-Holland.

K. Bimbó (2005) Types of I-free hereditary right maximal terms. Journal of Philosophical Logic 34 (5-6) 607620.

S. Broda , L. Damas , M. Finger and P. S. Silva e Silva (2004) The decidability of a fragment of BB′IW-logic. Theoretical Computer Science 318 (3) 373408.

M. W. Bunder (1996) Lambda Terms Definable as Combinators. Theoretical Computer Science 169 (1) 321.

J. B. Kruskal (1972) The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory, Series A 13 (3) 297305.

P.-A. Melliès (1998) On a duality between Kruskal and Dershowitz theorems. In: K. G Larsen , S. Skyum and G. Winskel (eds.) ICALP. Springer-Verlag Lecture Notes in Computer Science 1443 518529.

P. Trigg , J. R. Hindley and M. W. Bunder (1994) Combinatory abstraction using B, B′ and friends. Theoretical Computer Science 135 (2) 405422.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×