Regular dynamic logic is not interpretable in deterministic context-free dynamic logic

DOI10.1016/S0019-9958(83)80031-XMaRDI QIDQ3682465zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(83)80031-x

zbMATH Keywords

context-free programsexpressive powerfree Burnside groupgroup graphtruth-table property

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 4021106
• scientific article; zbMATH DE number 3858392
• scientific article; zbMATH DE number 3868597
• Deterministic dynamic logic is strictly weaker than dynamic logic
• scientific article; zbMATH DE number 3862425
• scientific article; zbMATH DE number 1794691
• Propositional dynamic logic of nonregular programs
• Dynamic detection of determinism in functional logic languages
• scientific article; zbMATH DE number 549960
• scientific article; zbMATH DE number 1953887

Cited in

(4)

• A simplified proof of \(DDL<DL\)
• scientific article; zbMATH DE number 3858392 (Why is no real title available?)
• scientific article; zbMATH DE number 4021106 (Why is no real title available?)
• scientific article; zbMATH DE number 1794691 (Why is no real title available?)

This page was built for publication: Regular dynamic logic is not interpretable in deterministic context-free dynamic logic

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