scientific article; zbMATH DE number 4179344

MaRDI QIDQ3203003zbMATH OpenFDO

Authors Alexej P. Stolboushkin

Publication date 1989

zbMATH Keywords

complexity boundsdynamic logicsAdian's structures

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• On static logics, dynamic logics, and complexity classes
• A simplified proof of \(DDL<DL\)
• Deterministic dynamic logic is strictly weaker than dynamic logic
• Algebraic Semantics for Dynamic Dynamic Logic
• scientific article; zbMATH DE number 4112562

Cited in

(8)

• ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS
• scientific article; zbMATH DE number 5599076 (Why is no real title available?)
• On static logics, dynamic logics, and complexity classes
• scientific article; zbMATH DE number 5840258 (Why is no real title available?)
• Complexity and expressivity of propositional dynamic logics with finitely many variables
• The comparison of the expressive power of first-order dynamic logics
• Limitations of the program memory and the expressive power of dynamic logics
• On the Quantifier-Free Dynamic Complexity of Reachability

This page was built for publication:

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