On the Completeness of Dynamic Logic

DOI10.1007/978-3-642-00596-1_7zbMath1234.03019OpenAlexW1519930863MaRDI QIDQ3617722

Daniel Leivant

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_7

zbMATH Keywords

dynamic logicrelative completenessarithmetical completenessinductive completeness

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Differential Game Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic
• Arithmetical completeness in first-order dynamic logic for concurrent programs
• A complete logic for reasoning about programs via nonstandard model theory. I
• Programs and program verifications in a general setting
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• First-order dynamic logic
• On strictly arithmetical completeness in logics of programs
• Inductive Completeness of Logics of Programs
• Dynamic Logic with Non-rigid Functions
• Soundness and Completeness of an Axiom System for Program Verification
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
• Foundations of Software Science and Computation Structures

This page was built for publication: On the Completeness of Dynamic Logic