|
This article is cited in 1 scientific paper (total in 1 paper)
Recognizability of all WIP-minimal logics
V. F. Yunab a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
We consider extensions of Johansson's minimal logic J. It was proved in [1] that the weak interpolation property (WIP) is decidable over the minimal logic. Moreover, all logics with WIP are divided into eight pairwise disjoint intervals. The notion of recognizable logic was introduced in [2]. The recognizability over J of five of the eight WIP-minimal logics, i.e. of the lower ends of intervals with WIP, was proved earlier in [2,3]. We prove the recognizability over J of the remaining three WIP-minimal logics.
Keywords:
minimal logic, interpolation property, decidability, recognizable logic.
Received: 07.03.2017
Citation:
V. F. Yun, “Recognizability of all WIP-minimal logics”, Sibirsk. Mat. Zh., 59:1 (2018), 225–237; Siberian Math. J., 59:1 (2018), 179–188
Linking options:
https://www.mathnet.ru/eng/smj2967 https://www.mathnet.ru/eng/smj/v59/i1/p225
|
|