Relational and Kleene-Algebraic Methods in Computer Science

DOI10.1007/B98117zbMATH Open1088.03019OpenAlexW2476951070MaRDI QIDQ5712428FDOQ5712428

Authors: Ullrich Hustadt, Renate A. Schmidt, Valentin 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

Recommendations

• scientific article; zbMATH DE number 4093649
• Completeness for sparse potential scattering
• Mathematics of Program Construction
• Complete form of Furuta inequality
• scientific article; zbMATH DE number 868085
• scientific article; zbMATH DE number 1684051
• Generalized scans and tridiagonal systems
• The complete solution to the Sylvester-polynomial-conjugate matrix equations
• Completeness of the set of scattering amplitudes

Mathematics Subject Classification ID

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

Cited In (11)

• Symbol elimination and applications to parametric entailment problems
• The Ackermann approach for modal logic, correspondence theory and second-order reduction
• SCAN -- elimination of predicate quantifiers
• Solving the \$100 modal logic challenge
• Completeness and correspondence in hybrid logic via an extension of SQEMA
• Algebraic modal correspondence: Sahlqvist and beyond
• Elementary canonical formulae: extending Sahlqvist's theorem
• Polynomial-time checking of generalized Sahlqvist syntactic shape
• On the strength and scope of DLS
• Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
• First-order resolution methods for modal logics

This page was built for publication: Relational and Kleene-Algebraic Methods in Computer Science

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