Unification and admissible rules for paraconsistent minimal Johanssons’ logic J and positive intuitionistic logic IPC^+статья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 20 марта 2018 г.
Аннотация:We study unification problem and problem of admissibility for inference rules in minimal Johanssonsʼ logic J and positive intuitionistic logic IPC^+. This paper proves that the problem of admissibility for inference rules with coefficients (parameters) (as well as plain ones – without parameters) is decidable for the paraconsistent minimal Johanssonsʼ logic J and the positive intuitionistic logic IPC^+. Using obtained technique we show also that the unification problem for these logics is also decidable: we offer algorithms which compute complete sets of unifiers for any unifiable formula. Checking just unifiability of formulas with coefficients also works via verification of admissibility.