Simplified semantics for relevant logics (and some of their rivals) (Q689076): Difference between revisions

In ``Simplified semantics for basic relevant logics'' [the reviewer and \textit{R. Sylvan}, ibid. 21, 217-232 (1992; Zbl 0782.03008)] it was shown that the basic relevant logic, \({\mathbf B}\), has a simplified ternary- relation semantics which dispenses with all conditions on the ternary relation, as well as the heredity condition. This paper shows how a wide range of relevant (and irrelevant) logics extending \({\mathbf B}\), including \({\mathbf R}\), but not \({\mathbf E}\), have a similar simplified semantics. Appropriate soundness and completeness theorems are proved, and the addition of Boolean negation is shown to be conservative for many of the systems.