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.
Similar content being viewed by others
References
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.
W. Rautenberg, Klassische und Nicht-Klassische Aussagenlogik, Vieweg, Braunschweig (1979).
K. Dosen, “Negation as a modal operator,” Rep. Math. Log., 20, 15-28 (1986).
K. Dosen, “Negation in the light of modal logic,” in What is Negation? Appl. Log. Ser., 13, Kluwer, Dordrecht (1999), pp. 77-86.
S. P. Odintsov, “Combining intuitionistic connectives and Routley negation,” Sib. Electr. Math. Rep., 7, 21-41 (2010).
R. Routley and V. Routley, “The semantics of first degree entailment,” Nous, 6, 335-359 (1972).
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).
S. A. Drobyshevich, “Filtration for logic N *,” Mal’tsev Readings (2010), p. 41.
Author information
Authors and Affiliations
Corresponding author
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
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
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-011-9138-5