Decidability results in non-classical logics
From MaRDI portal
Publication:4067091
DOI10.1016/0003-4843(75)90004-2zbMath0309.02053OpenAlexW2604667307MaRDI QIDQ4067091
Publication date: 1975
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(75)90004-2
Related Items
The completeness theorems for some intuitionistic epistemic logics in terms of interval semantics ⋮ A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics ⋮ Basic conditional logic ⋮ Logic and time ⋮ Efficient local reductions to basic modal logic ⋮ On decidable, finitely axiomatizable, modal and tense logics without the finite model property. I, II ⋮ Deciding regular grammar logics with converse through first-order logic ⋮ Local is best: efficient reductions to modal logic \textsf{K} ⋮ Graded modalities. I