A note on the decidability of a strong relevant logic (Q1066881)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the decidability of a strong relevant logic |
scientific article; zbMATH DE number 3926880
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the decidability of a strong relevant logic |
scientific article; zbMATH DE number 3926880 |
Statements
A note on the decidability of a strong relevant logic (English)
0 references
1985
0 references
The system S of relevant logic introduced earlier by the author [ibid. 38, 137-147 (1979; Zbl 0406.03029)] and proved complete for a Kripke-type semantics, is proved here by a filtration argument to be decidable.
0 references
0 references
0.88900805
0 references
0 references
0.88339907
0 references
0.88069564
0 references
