Relational and Kleene-Algebraic Methods in Computer Science

DOI10.1007/b98117zbMath1088.03019OpenAlexW2476951070MaRDI QIDQ5712428

Ullrich Hustadt, Renate A. Schmidt, Valentin F. Goranko, Dimiter Vakarelov

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98117

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Classical first-order logic (03B10)

Related Items

Symbol elimination and applications to parametric entailment problems, Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications, Algebraic modal correspondence: Sahlqvist and beyond, The Ackermann approach for modal logic, correspondence theory and second-order reduction, First-Order Resolution Methods for Modal Logics, Elementary canonical formulae: extending Sahlqvist's theorem, Solving the \$100 modal logic challenge, Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA