Siberian Mathematical Journal

, Volume 58, Issue 6, pp 1042–1051 | Cite as

Slices and Levels of Extensions of the Minimal Logic

  • L. L. Maksimova
  • V. F. Yun


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.


minimal logic Kripke frame decidability slice level recognizable logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Johansson I., “Der Minimalkalkül, ein reduzierter intuitionistische Formalismus,” Compos. Math., vol. 4, 119–136 (1937).MATHGoogle Scholar
  2. 2.
    Maksimova L. L. and Yun V. F., “Layers over minimal logic,” Algebra and Logic, vol. 55, no. 4, 295–305 (2016).MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Hosoi T., “On intermediate logics. I,” J. Fac. Sci., Univ. Tokyo, Sec. Ia, vol. 14, 293–312 (1967).MathSciNetMATHGoogle Scholar
  4. 4.
    Maksimova L. L., “The structure of slices over minimal logic,” Sib. Math. J., vol. 57, no. 5, 841–848 (2016).MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Maksimova L., “Strongly decidable properties of modal and intuitionistic calculi,” Log. J. IGPL, vol. 8, no. 6, 797–819 (2000).MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Maksimova L. L. and Yun V. F., “Recognizable logics,” Algebra and Logic, vol. 54, no. 2, 183–187 (2015).MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Maksimova L. L. and Yun V. F., “Strong decidability and strong recognizability,” Algebra and Logic, vol. 56, no. 5 (2017).Google Scholar
  8. 8.
    Rautenberg W., Klassische und nichtklassiche Aussagenlogik, Vieweg-Verlag, Wiesbaden (1979).CrossRefMATHGoogle Scholar
  9. 9.
    Odintsov S., Constructive Negations and Paraconsistency, Springer-Verlag, Dordrecht (2008) (Trends in Logic; vol. 26).CrossRefMATHGoogle Scholar
  10. 10.
    Rasiowa H. and Sikorski R., The Mathematics of Metamathematics, PWN, Warsaw (1962).MATHGoogle Scholar
  11. 11.
    Segerberg K., “Propositional logics related to Heyting’s and Johansson’s,” Theoria, vol. 34, 26–61 (1968).MathSciNetCrossRefGoogle Scholar
  12. 12.
    Maksimova L. L., “A method of proving interpolation in paraconsistent extensions of the minimal logic,” Algebra and Logic, vol. 46, no. 5, 341–353 (2007).MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Stone M. H., “Topological representations of distributive lattices and Brouwerian logics,” Časopis Pěst. Mat., vol. 67, no. 1, 1–25 (1938).MATHGoogle Scholar
  14. 14.
    Odintsov S. P., “Logic of classical refutability and class of extensions of minimal logic,” Log. Log. Philos., vol. 9, 91–107 (2001).MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Dummett M., “A propositional calculus with denumerable matrix,” J. Symb. Log., vol. 24, 97–106 (1959).MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Maksimova L. L., “The decidability of Craig’s interpolation property in well-composed J-logics,” Sib. Math. J., vol. 53, no. 5, 839–852 (2012).MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Dunn J. M. and Meyer R. K., “Algebraic completeness results for Dummett’s LC and its extensions,” Z. Math. Logik Grundlag. Math., vol. 17, 225–230 (1971).MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2017

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsNovosibirsk State UniversityNovosibirskRussia

Personalised recommendations