Foundations of Software Science and Computation Structures

DOI10.1007/B95995zbMATH Open1126.03314OpenAlexW3105029025MaRDI QIDQ5308458FDOQ5308458

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

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

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A completeness theorem for dynamic logic
• On the Completeness of Dynamic Logic
• Title not available (Why is that?)
• Title not available (Why is that?)

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)