|
This article is cited in 4 scientific papers (total in 4 papers)
Bases of admissible rules for $K$-saturated logics
V. V. Rimatskii Siberian Federal University, Institute of Architecture and Construction
Abstract:
Admissible inference rules for table modal and superintuitionistic logics are investigated. $K$-saturated logics are defined semantically. Such logics are proved to have finite bases for admissible inference rules in finitely many variables.
Keywords:
admissible inference rules, basis for admissible inference rules, table modal logic, superintuitionistic logic.
Received: 15.04.2002 Revised: 07.03.2007
Citation:
V. V. Rimatskii, “Bases of admissible rules for $K$-saturated logics”, Algebra Logika, 47:6 (2008), 750–761; Algebra and Logic, 47:6 (2008), 420–425
Linking options:
https://www.mathnet.ru/eng/al385 https://www.mathnet.ru/eng/al/v47/i6/p750
|
Statistics & downloads: |
Abstract page: | 240 | Full-text PDF : | 71 | References: | 51 | First page: | 8 |
|