The complexity of the validity problem for dynamic logic

DOI10.1016/S0019-9958(82)91242-6zbMATH Open0521.03023MaRDI QIDQ3671141FDOQ3671141

Authors: Kenneth L. Manders, Robert F. Daley 

Publication date: 1982

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

zbMATH Keywords

dynamic logicvalidity problemclosure under renaminginfinitary first-order logic

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Logic with extra quantifiers and operators (03C80) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract model theory (03C95) Complexity of proofs (03F20) Abstract data types; algebraic specification (68Q65) Undecidability and degrees of sets of sentences (03D35)

Cited In (1)

• Non-standard algorithmic and dynamic logic

This page was built for publication: The complexity of the validity problem for dynamic logic

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