TY - JOUR

T1 - Recognizability of All WIP-Minimal Logics

AU - Yun, V. F.

N1 - Publisher Copyright: © 2018, Pleiades Publishing, Ltd.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - decidability

KW - interpolation property

KW - minimal logic

KW - recognizable logic

UR - http://www.scopus.com/inward/record.url?scp=85043494712&partnerID=8YFLogxK

U2 - 10.1134/S0037446618010196

DO - 10.1134/S0037446618010196

M3 - Article

AN - SCOPUS:85043494712

VL - 59

SP - 179

EP - 188

JO - Siberian Mathematical Journal

JF - Siberian Mathematical Journal

SN - 0037-4466

IS - 1

ER -