Skip to main content
SpringerLink
Log in

Recognizable Logics

  • Published:
Algebra and Logic Aims and scope

We look into the recognition problem for extensions of Johansson’s minimal logic J. It is proved that certain of the known logics are recognizable over J. Namely, recognizability over J is revealed for all well-composed logics possessing Craig’s interpolation property (CIP), the restricted interpolation property (IPR), or the projective Beth property (PBP). It is proved that the logic JF is not reliably recognizable over J. Furthermore, we establish a link between the algebraic and the modified Kripke semantics, and give a criterion for being reliably recognizable in terms of characteristic formulas.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Kuznetsov, “Undecidability of general problems of completeness, decidability and equivalence for propositional calculi,” Algebra Logika, 2, No. 4, 47–66 (1963).

    MATH  Google Scholar 

  2. A. Chagrov, “Undecidable properties of superintuitionistic logics,” in Mathematical Problems in Cybernetics, Iss. 5 (1994), pp. 62–108.

  3. I. Johansson, “Der Minimalkalk¨ul, ein reduzierter intuitionistischer Formalismus,” Comp. Math., 4, 119–136 (1937).

    Google Scholar 

  4. L. L. Maksimova, “Classification of extensions of the modal logic S4,” Sib. Math. J., 54, No. 6, 1064–1075 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  5. L. L. Maksimova, “Restricted interpolation over modal logic S4,” Algebra and Logic, 52, No. 4, 308–335 (2013).

    Article  MathSciNet  Google Scholar 

  6. S. P. Odintsov, Constructive Negations and Paraconsistency, Trends Log., Stud. Log. Libr., 26, Springer, Dordrecht (2008).

  7. S. Miura, “A remark on the intersection of two logics,” Nagoya Math. J., 26, 167–171 (1966).

    MathSciNet  MATH  Google Scholar 

  8. L. L. Maksimova, “Decidability of the weak interpolation property over the minimal logic,” Algebra and Logic, 50, No. 2, 106–132 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  9. A. I. Mal’tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  10. L. L. Maksimova, “The decidability of Craig’s interpolation property in well-composed Jlogics,” Sib. Math. J., 53, No. 5, 839–852 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  11. L. L. Maksimova, “Craig’s theorem in superintuitionistic logics and amalgamable varieties of pseudo-Boolean algebras,” Algebra and Logic, 16, No. 6, 427–455 (1977).

    Article  MathSciNet  Google Scholar 

  12. L. L. Maksimova, “Decidability of the projective Beth property in varieties of Heyting algebras,” Algebra and Logic, 40, No. 3, 159–165 (2001).

    Article  MathSciNet  Google Scholar 

  13. L. Maksimova, “Problem of restricted interpolation in superintuitionistic and some modal logics,” Log. J. IGPL, 18, No. 3, 367–380 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  14. L. L. Maksimova, “The projective Beth property in well-composed logics,” Algebra and Logic, 52, No. 2, 116–136 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  15. D. M. Gabbay and L. Maksimova, Interpolation and Definability: Modal and Intuitionistic Logics, Clarendon Press, Oxford (2005).

    Book  MATH  Google Scholar 

  16. A. Chagrov, “Undecidable properties of extensions of a provability logic. II,” Algebra and Logic, 29, No. 5, 406–413 (1990).

    Article  MathSciNet  MATH  Google Scholar 

  17. L. L. Maksimova, “Interpolation and the projective Beth property in well-composed logics,” Algebra and Logic, 51, No. 2, 163–184 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  18. V. A. Yankov, “The relationship between deducibility in the intuitionistic propositional calculus and finite implicational structures,” Dokl. Akad. Nauk SSSR, 151, No. 6, 1293–1294 (1963).

    MathSciNet  Google Scholar 

  19. K. Segerberg, “Propositional logics related to Heyting’s and Johansson’s,” Theoria, 34, 26–61 (1968).

    Article  MathSciNet  Google Scholar 

  20. L. L. Maksimova, “A method of proving interpolation in paraconsistent extensions of the minimal logic,” Algebra and Logic, 46, No. 5, 341–353 (2007).

    Article  MathSciNet  Google Scholar 

  21. L. L. Maksimova, “Pretable superintuitionistic logics,” Algebra and Logic, 11, No. 5, 308–314 (1972).

    Article  Google Scholar 

  22. M. V. Stukachyova, “The disjunction property in the class of paraconsistent extensions of minimal logic,” Algebra and Logic, 43, No. 2, 132–141 (2004).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    L. L. Maksimova

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    V. F. Yun

Authors
  1. L. L. Maksimova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. F. Yun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to L. L. Maksimova or V. F. Yun.

Additional information

Supported by RFBR (project No. 12-01-00168a) and by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (grant NSh-860.2014.1).

Translated from Algebra i Logika, Vol. 54, No. 2, pp. 252–274, March-April, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Maksimova, L.L., Yun, V.F. Recognizable Logics. Algebra Logic 54, 167–182 (2015). https://doi.org/10.1007/s10469-015-9336-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-015-9336-7

Keywords

Search

Navigation