The following pages link to Ticket Entailment is decidable (Q4925031):
Displaying 7 items.
- Current trends in substructural logics (Q266641) (← links)
- Types of I-free hereditary right maximal terms (Q812102) (← links)
- Issues in machine-checking the decidability of implicational ticket entailment (Q1694477) (← links)
- Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment (Q2254561) (← links)
- IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE (Q3188334) (← links)
- On the decidability of implicational ticket entailment (Q4916555) (← links)
- Constructive decision via redundancy-free proof-search (Q5919012) (← links)