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.
Fischer and Richard E
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
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.
-
Guarded Negation Transitive Closure Logic
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.