Issues in machine-checking the decidability of implicational ticket entailment
From MaRDI portal
Publication:1694477
DOI10.1007/978-3-319-66902-1_21zbMath1496.68373OpenAlexW2752354736MaRDI QIDQ1694477
Publication date: 2 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-66902-1_21
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Formalization of mathematics in connection with theorem provers (68V20)
Related Items (1)
Uses Software
This page was built for publication: Issues in machine-checking the decidability of implicational ticket entailment
