scientific article; zbMATH DE number 4008371
[For the entire collection see Zbl 0598.00008.] In this paper symmetric dynamic logic (SDL) is proposed in the form of sequential calculi. Symmetric dynamic logic enables us: (1) to obtain uniform calculi definitions for functional dynamic logic (FDL) and propositional dynamic logic (PDL), possessing better proof-theoretical properties than traditional definitions of FDL and PDL; (2) to prove that the properties of program termination as well as of total correctness of deterministic programs are decidable with respect to arithmetic with formula variables. (2) agrees with the statement of \textit{A. R. Meyer} and \textit{J. Y. Halpern} [J. Assoc. Comput. Mach. 29, 555-576 (1982; Zbl 0478.68009)] that terminal assertions are more tractable than those of partial correctness.
- Sequential dynamic logic
- Sequential calculus for proving the properties of regular programs
- Loop-free verification of termination of derivation for a fragment of dynamic logic
- scientific article; zbMATH DE number 3912349 (Why is no real title available?)
- scientific article; zbMATH DE number 3918336 (Why is no real title available?)
- scientific article; zbMATH DE number 3559517 (Why is no real title available?)
- A sequent calculus for first-order dynamic logic with trace modalities
- Sequential operators in computability logic
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 Q3758809)