Skip to main content
Log in

A hybrid calculus for logic N *: residual finiteness and decidability

  • Published:
Algebra and Logic Aims and scope

It is proved that logic N * is residually finite and decidable. A hybrid calculus for the logic is constructed based on a tabular calculus for intuitionistic logic. It is shown that the hybrid calculus is sound and complete.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Cabalar, S. P. Odintsov, and D. Pearce, “Logical foundations of well-founded semantics,” in Principles of Knowledge Representation and Reasoning, Proc. 10th Int. Conf. (KR2006), AAAI Press, Menlo Park, California (2006), pp. 25-36.

    Google Scholar 

  2. W. Rautenberg, Klassische und Nicht-Klassische Aussagenlogik, Vieweg, Braunschweig (1979).

    Google Scholar 

  3. K. Dosen, “Negation as a modal operator,” Rep. Math. Log., 20, 15-28 (1986).

    MathSciNet  MATH  Google Scholar 

  4. K. Dosen, “Negation in the light of modal logic,” in What is Negation? Appl. Log. Ser., 13, Kluwer, Dordrecht (1999), pp. 77-86.

    Google Scholar 

  5. S. P. Odintsov, “Combining intuitionistic connectives and Routley negation,” Sib. Electr. Math. Rep., 7, 21-41 (2010).

    MathSciNet  Google Scholar 

  6. R. Routley and V. Routley, “The semantics of first degree entailment,” Nous, 6, 335-359 (1972).

    Article  MathSciNet  Google Scholar 

  7. S. P. Odintsov and H. Wansing, “Inconsistency-tolerant description logic. II: A tableau algorithm for CALCC,” J. Appl. Log., 6, No. 3, 343-360 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  8. S. A. Drobyshevich, “Filtration for logic N *,” Mal’tsev Readings (2010), p. 41.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. A. Drobyshevich.

Additional information

Supported by RFBR (project No. 09-01-00090-a).

Translated from Algebra i Logika, Vol. 50, No. 3, pp. 351-367, May-June, 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Drobyshevich, S.A. A hybrid calculus for logic N *: residual finiteness and decidability. Algebra Logic 50, 245–256 (2011). https://doi.org/10.1007/s10469-011-9138-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-011-9138-5

Keywords

Navigation