Foundations of Software Science and Computation Structures

DOI10.1007/B95995MaRDI QIDQ5308458zbMATH OpenOpenAlexFDO

Authors Daniel M. Leivant

Publication date 28 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95995

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) First-order arithmetic and fragments (03F30)

Recommendations

• A completeness theorem for dynamic logic
• Some general incompleteness results for partial correctness logics
• On the Completeness of Dynamic Logic
• Two theorems about the completeness of Hoare's logic
• Effective Axiomatizations of Hoare Logics

Cited in

(6)

• scientific article; zbMATH DE number 4016871 (Why is no real title available?)
• scientific article; zbMATH DE number 4080898 (Why is no real title available?)
• A completeness theorem for dynamic logic
• On the Completeness of Dynamic Logic
• scientific article; zbMATH DE number 3856389 (Why is no real title available?)
• scientific article; zbMATH DE number 2213623 (Why is no real title available?)

This page was built for publication: Foundations of Software Science and Computation Structures

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