Skip to main content
SpringerLink
Log in

Recognizability of All WIP-Minimal Logics

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We consider extensions of Johansson’s minimal logic J. It was proved in [1] that the weak interpolation property (WIP) is decidable over the minimal logic. Moreover, all logics with WIP are divided into eight pairwise disjoint intervals. The notion of recognizable logic was introduced in [2]. The recognizability over J of five of the eight WIP-minimal logics, i.e. of the lower ends of intervals with WIP, was proved earlier in [2, 3]. We prove the recognizability over J of the remaining three WIP-minimal logics.

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. Maksimova L. L., “Decidability of the weak interpolation property over the minimal logic,” Algebra and Logic, vol. 50, no. 2, 106–132 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  2. Maksimova L. L. and Yun V. F., “Recognizable logics,” Algebra and Logic, vol. 54, no. 2, 183–187 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  3. Maksimova L. L. and Yun V. F., “Strong decidability and strong recognizability,” Algebra and Logic, vol. 56, no. 5 (2017).

    Google Scholar 

  4. Maksimova L. L., “Negative equivalence over the minimal logic and interpolation,” Sib. Elektron. Mat. Izv., vol. 11, 1–17 (2014).

    MathSciNet  MATH  Google Scholar 

  5. Maksimova L. L. and Yun V. F., “WIP-minimal logics and interpolation,” Sib. Elektron. Mat. Izv., vol. 12, 7–20 (2015).

    MathSciNet  MATH  Google Scholar 

  6. Odintsov S., Constructive Negations and Paraconsistency, Springer-Verlag, Dordrecht (2008) (Trends Logic; vol. 26).

  7. Johansson I., “Der Minimalkalkül, ein reduzierter intuitionistische Formalismus,” Compos. Math., vol. 4, 119–136 (1937).

    MATH  Google Scholar 

  8. Craig W., “Three uses of Herbrand–Gentzen theorem in relating model theory,” J. Symb. Log., vol. 22, 269–285 (1957).

    Article  MathSciNet  MATH  Google Scholar 

  9. Maksimova L., “Interpolation and definability over the logic GL,” Studia Log., vol. 99, no. 1–3, 249–267 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  10. 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).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  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).

    Article  MathSciNet  MATH  Google Scholar 

  13. Gabbay D. M., “The decidability of the Kreisel–Putnam system,” J. Symb. Log., vol. 35, no. 3, 431–437 (1970).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk State University, Novosibirsk, Russia

    V. F. Yun

Authors
  1. V. F. Yun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. F. Yun.

Additional information

Original Russian Text Copyright © 2018 Yun V. F.

Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 59, No. 1, pp. 225–237, January–February, 2018; DOI: 10.17377/smzh.2018.59.119

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yun, V.F. Recognizability of All WIP-Minimal Logics. Sib Math J 59, 179–188 (2018). https://doi.org/10.1134/S0037446618010196

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0037446618010196

Keywords

Search

Navigation