On the Correspondence Between Modal and Classical Logic: an Automated Approach

DOI10.1093/LOGCOM/3.6.605MaRDI QIDQ4286209zbMATH OpenOpenAlexFDO

Authors Andrzej Szałas

Publication date 15 December 1994

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0014-B1BE-5

zbMATH Keywords

first-order logicmodal logicautomated translationelimination of second-order quantification

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35)

Recommendations

• On an automated translation of modal proof rules into formulas of the classical logic
• Translation Methods for Non-Classical Logics: An Overview
• scientific article; zbMATH DE number 517003
• The axiomatic translation principle for modal logic
• Semantics-Based Translation Methods for Modal Logics

Cited in

(23)

• Towards incorporating background theories into quantifier elimination
• Second-order reasoning in description logics
• The Ackermann approach for modal logic, correspondence theory and second-order reduction
• General domain circumscription and its first-order reduction
• The axiomatic translation principle for modal logic
• Converse-PDL with regular inclusion axioms: a framework for MAS logics
• Combining and automating classical and non-classical logics in classical higher-order logics
• A principle for incorporating axioms into the first-order translation of modal formulae.
• Completeness and correspondence in hybrid logic via an extension of SQEMA
• A set-theoretic translation method for (poly)modal logics
• Annotation theories over finite graphs
• scientific article; zbMATH DE number 1759442 (Why is no real title available?)
• Algebraic modal correspondence: Sahlqvist and beyond
• Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
• On an automated translation of modal proof rules into formulas of the classical logic
• On the strength and scope of DLS
• Deterministic SQEMA and application for pre-contact logic
• Towards automating duality
• First-order resolution methods for modal logics
• Approximate databases: a support tool for approximate reasoning
• Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras
• Alternative translation techniques for propositional and first-order modal logics
• 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05

This page was built for publication: On the Correspondence Between Modal and Classical Logic: an Automated Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286209)