Simplified semantics for relevant logics (and some of their rivals) (Q689076): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01349561 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2162300758 / rank | |||
Normal rank |
Latest revision as of 09:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simplified semantics for relevant logics (and some of their rivals) |
scientific article |
Statements
Simplified semantics for relevant logics (and some of their rivals) (English)
0 references
16 February 1994
0 references
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.
0 references
basic relevant logic
0 references
ternary-relation semantics
0 references
Boolean negation
0 references