A hybrid calculus for logic \(N^{*}\): residual finiteness and decidability

DOI10.1007/S10469-011-9138-5zbMath1252.03075OpenAlexW2076009311MaRDI QIDQ695777

Sergey Drobyshevich

Publication date: 17 December 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-011-9138-5

zbMATH Keywords

modal logicintuitionistic logichybrid calculustabular calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

Composition of an intuitionistic negation and negative modalities as a necessity operator ⋮ Double Negation Operator in Logic N ∗

Cites Work

• Combining intuitionistic connectives and Routley negation
• Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)
• A semantical analysis of implicational system I and of the first degree of entailment
• Unnamed Item

This page was built for publication: A hybrid calculus for logic \(N^{*}\): residual finiteness and decidability