Completeness of Hoare Logic Relative to the Standard Model

DOI10.1007/978-3-319-51963-0_10zbMath1444.03122arXiv1703.00237OpenAlexW2571534558MaRDI QIDQ2971129

Wen-Hui Zhang, Zhaowei Xu, Yuefei Sui

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.00237

zbMATH Keywords

standard modelPeano arithmeticarithmetical hierarchyrelative completenessHoare logic

Mathematics Subject Classification ID

Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressiveness and the completeness of Hoare's logic
• Completeness of Hoare logic with inputs over the standard model
• Ten years of Hoare's logic: A survey. II: Nondeterminism
• Hoare's logic and Peano's arithmetic
• Recursive assertions are not enough - or are they?
• On the completeness of propositional Hoare logic
• Hoare logic and auxiliary variables
• Computability and Logic
• On relative completeness of Hoare logics
• Effective Axiomatizations of Hoare Logics
• Ten Years of Hoare's Logic: A Survey—Part I
• Soundness and Completeness of an Axiom System for Program Verification
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
• An axiomatic basis for computer programming

This page was built for publication: Completeness of Hoare Logic Relative to the Standard Model