scientific article; zbMATH DE number 4179344

zbMATH Open0716.03018MaRDI QIDQ3203003FDOQ3203003

Authors: Alexej P. Stolboushkin 

Publication date: 1989

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

complexity boundsdynamic logicsAdian's structures

Mathematics Subject Classification ID

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

Cited In (8)

• ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS
• Title not available (Why is that?)
• On static logics, dynamic logics, and complexity classes
• Title not available (Why is that?)
• 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)