Ticket Entailment is decidable

DOI10.1017/S0960129512000412zbMath1280.03014OpenAlexW2060988679MaRDI QIDQ4925031

Vincent Padovani

Publication date: 11 June 2013

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129512000412

zbMATH Keywords

decidabilityticket entailment\(\mathrm{BB}^\prime\mathrm{IW}\) logic\(T_{\to}\)

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)

Related Items

Current trends in substructural logics ⋮ IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE ⋮ Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment ⋮ Constructive decision via redundancy-free proof-search

Cites Work

• The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Types of I-free hereditary right maximal terms
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• Lambda terms definable as combinators
• The theory of well-quasi-ordering: a frequently discovered concept
• The undecidability of entailment and relevant implication

This page was built for publication: Ticket Entailment is decidable