Arithmetical completeness versus relative completeness
By using nonstandard models for arithmetics and Skolemization techniques, the author shows that as far as finitistic proof systems for dynamic logic are concerned, we cannot expect more than D. Harel's arithmetical completeness.
scientific article; zbMATH DE number 4091473