Relevance logic: problems open and closed

MaRDI QIDQ2966516zbMATH OpenFDO

Authors Alasdair Urquhart

Publication date 7 March 2017

Full work available at URL http://ojs.victoria.ac.nz/ajl/article/view/3926/3513

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Recommendations

• The complexity of decision procedures in relevance logic II
• scientific article; zbMATH DE number 2072508
• Some relevance logics from the point of view of relational semantics
• The undecidability of entailment and relevant implication
• scientific article; zbMATH DE number 6868329

Cited in

(17)

• Relevant S is undecidable
• Implicational relevance logic is 2-\textsc{ExpTime}-complete
• Some relevance logics from the point of view of relational semantics
• scientific article; zbMATH DE number 4063072 (Why is no real title available?)
• Computer Science Logic
• A conservative negation extension of positive semilattice logic without the finite model property
• Four variables suffice
• Operational semantics for positive R
• Relational patterns, partiality, and set lifting in modal semantics
• scientific article; zbMATH DE number 3849196 (Why is no real title available?)
• Solutions to some open problems from Slaney
• A characteristic frame for positive intuitionistic and relevance logic
• The Relevance Logic Programme: Failed or Just Stalled?
• Decidable subsets of open logic and an algorithm for R-calculus
• A Logical Autobiography
• Relevance-Sensitive Truth-Trees
• Revisiting Semilattice Semantics

This page was built for publication: Relevance logic: problems open and closed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2966516)