|
This article is cited in 18 scientific papers (total in 18 papers)
Recognizable logics
L. L. Maksimovaab, V. F. Yunba a Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia
b Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia
Abstract:
We look into the recognition problem for extensions of Johansson's minimal logic J. It is proved that certain of the known logics are recognizable over J. Namely, recognizability over J is revealed for all well-composed logics possessing Craig's interpolation property (CIP), the restricted interpolation property (IPR), or the projective Beth property (PBP). It is proved that the logic JF is not reliably recognizable over J. Furthermore, we establish a link between the algebraic and the modified Kripke semantics, and give a criterion for being reliably recognizable in terms of characteristic formulas.
Keywords:
Johansson’s minimal logic, recognizability, reliable recognizability, interpolation property, characteristic formula.
Received: 27.06.2014
Citation:
L. L. Maksimova, V. F. Yun, “Recognizable logics”, Algebra Logika, 54:2 (2015), 252–274; Algebra and Logic, 54:2 (2015), 167–182
Linking options:
https://www.mathnet.ru/eng/al691 https://www.mathnet.ru/eng/al/v54/i2/p252
|
Statistics & downloads: |
Abstract page: | 361 | Full-text PDF : | 91 | References: | 68 | First page: | 19 |
|