On the strength and scope of DLS

DOI10.3166/jancl.16.279-296zbMath1186.03042OpenAlexW1968397692MaRDI QIDQ3647241

Willem Conradie

Publication date: 30 November 2009

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

Full work available at URL: https://doi.org/10.3166/jancl.16.279-296

zbMATH Keywords

modal logiccanonicitysecond-order quantifier eliminationSahlqvist formulaeinductive formulaeDLS algorithm

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Quantifier elimination, model completeness, and related topics (03C10)

Related Items

Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications ⋮ Algebraic modal correspondence: Sahlqvist and beyond ⋮ Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions ⋮ Unnamed Item ⋮ IV. Semantic extensions of SQEMA ⋮ Towards incorporating background theories into quantifier elimination ⋮ Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA

Cites Work

• Un-Skolemizing clause sets
• Computing circumscription revisited: A reduction algorithm
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• Elementary canonical formulae: extending Sahlqvist's theorem
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA