Partial-correctness assertions for iterative programs are provable in Hoare logic if and only if they are provable in second-order logic with comprehension restricted to first-order predicates.
Dynamic Logic
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A foundational characterization of Hoare Logic
Partial-correctness assertions for iterative programs are provable in Hoare logic if and only if they are provable in second-order logic with comprehension restricted to first-order predicates.