The Ackermann approach for modal logic, correspondence theory and second-order reduction

DOI10.1016/J.JAL.2012.01.001zbMATH Open1248.03039OpenAlexW2043056708MaRDI QIDQ420837FDOQ420837

Authors: Renate A. Schmidt 

Publication date: 23 May 2012

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2012.01.001

Recommendations

• Improved Second-Order Quantifier Elimination in Modal Logic
• scientific article; zbMATH DE number 1303431
• IV. Semantic extensions of SQEMA
• scientific article; zbMATH DE number 1931662
• Relational Methods in Computer Science

zbMATH Keywords

modal logicAckermann lemmaaxiom and rule reductionscorrespondence theorysecond-order quantifier eliminationsubstitution method

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35) Quantifier elimination, model completeness, and related topics (03C10)

Cites Work

• Modal logic
• Resolution theorem proving
• Title not available (Why is that?)
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Elementary canonical formulae: extending Sahlqvist's theorem
• The truth about algorithmic problems in correspondence theory
• Title not available (Why is that?)
• Refutational theorem proving for hierarchic first-order theories
• Computing circumscription revisited: A reduction algorithm
• Improved Second-Order Quantifier Elimination in Modal Logic
• Second-order quantifier elimination. Foundations, computational aspects and applications
• Title not available (Why is that?)
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• The Monotonous Elimination of Predicate Variables
• Relational and Kleene-Algebraic Methods in Computer Science

Cited In (8)

• Title not available (Why is that?)
• Relational Methods in Computer Science
• Predicate Elimination for Preprocessing in First-Order Theorem Proving
• Title not available (Why is that?)
• Semantic forgetting in expressive description logics
• On the strength and scope of DLS
• Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
• Modal deduction in second-order logic and set theory. II

Uses Software

• SQEMA

This page was built for publication: The Ackermann approach for modal logic, correspondence theory and second-order reduction

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