On an automated translation of modal proof rules into formulas of the classical logic

DOI10.1080/11663081.1994.10510828zbMath0809.03009OpenAlexW2002595895MaRDI QIDQ4317726

Andrzej Szałas

Publication date: 21 December 1994

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.1994.10510828

zbMATH Keywords

modal logicautomated theorem provingclassical logiccorrespondence theorymodal proof rules

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Related Items (1)

Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals

Cites Work

• Solvable cases of the decision problem
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• Incompactness in languages with infinitely long expressions

This page was built for publication: On an automated translation of modal proof rules into formulas of the classical logic