Arithmetical completeness in first-order dynamic logic for concurrent programs

DOI10.2977/PRIMS/1195186718MaRDI QIDQ1155351zbMATH OpenOpenAlexFDO

Authors 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) General topics in the theory of software (68N01) Abstract data types; algebraic specification (68Q65)

Cites work

• An axiomatic basis for computer programming
• An axiomatic proof technique for parallel programs
• First-order dynamic logic
• scientific article; zbMATH DE number 3566183 (Why is no real title available?)
• scientific article; zbMATH DE number 3569793 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)

Cited in

(2)

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

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

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