# Strong Decidability and Strong Recognizability

Результат исследования: Научные публикации в периодических изданияхстатьярецензирование

6 Цитирования (Scopus)

## Аннотация

Extensions of Johansson’s minimal logic J are considered. It is proved that families of negative and nontrivial logics and a series of other families are strongly decidable over J. This means that, given any finite list Rul of axiom schemes and rules of inference, we can effectively verify whether the logic with axioms and schemes, J + Rul, belongs to a given family. Strong recognizability over J is proved for known logics Neg, Gl, and KC as well as for logics LC and NC and all their extensions.

Язык оригинала английский 370-385 16 Algebra and Logic 56 5 https://doi.org/10.1007/s10469-017-9459-0 Опубликовано - 1 ноя 2017