Arithmetical completeness in first-order dynamic logic for concurrent programs

DOI10.2977/PRIMS/1195186718zbMath0466.68023OpenAlexW2038186075MaRDI QIDQ1155351

Hirokazu Nishimura

Publication date: 1981

Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2977/prims/1195186718

zbMATH Keywords

arithmetical axiomatizationregular first-order dynamic logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (2)

On the Completeness of Dynamic Logic ⋮ Propositional dynamic logic for concurrent programs

Cites Work

• An axiomatic proof technique for parallel programs
• First-order dynamic logic
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Arithmetical completeness in first-order dynamic logic for concurrent programs