The comparison of the expressive power of first-order dynamic logics

DOI10.1016/0304-3975(83)90099-3zbMath0536.03015OpenAlexW1985209653MaRDI QIDQ791517

Michael A. Taitslin, Alexei P. Stolboushkin

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90099-3

zbMATH Keywords

dynamic logicexpressive powerdeterministic regular logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Basic properties of first-order languages and structures (03C07)

Related Items

IN MEMORIAM: MIKHAIL A. TAITSLIN 1936–2013, Role of determinism in query languages for data bases, A technique for proving decidability of containment and equivalence of linear constraint queries, A.D. Taimanov and model theory in Kazakhstan, Extended order-generic queries

Cites Work

• New estimates of odd exponents of infinite Burnside groups.
• First-order dynamic logic
• Optimization of LR(k) parsers
• Unnamed Item
• Unnamed Item