The complexity of the validity problem for dynamic logic

DOI10.1016/S0019-9958(82)91242-6MaRDI QIDQ3671141zbMATH OpenFDO

Authors Kenneth L. Manders, Robert F. Daley

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/S0019-9958(82)91242-6

zbMATH Keywords

closure under renamingdynamic logicinfinitary first-order logicvalidity problem

Mathematics Subject Classification ID

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

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)