Slices and Levels of Extensions of the Minimal Logic
- 2 Downloads
We consider two classifications of extensions of Johansson’s minimal logic J. Logics and then calculi are divided into levels and slices with numbers from 0 to ω. We prove that the first classification is strongly decidable over J, i.e., from any finite list Rul of axiom schemes and inference rules, we can effectively compute the level number of the calculus (J + Rul). We prove the strong decidability of each slice with finite number: for each n and arbitrary finite Rul, we can effectively check whether the calculus (J + Rul) belongs to the nth slice.
Keywordsminimal logic Kripke frame decidability slice level recognizable logic
Unable to display preview. Download preview PDF.
- 7.Maksimova L. L. and Yun V. F., “Strong decidability and strong recognizability,” Algebra and Logic, vol. 56, no. 5 (2017).Google Scholar