Arithemtical Completeness in Logics of Programs
We consider the problem of designing arithmetically complete axiom systems for proving general properties of programs; 1.e. axiom systems which are complete over arithmetical universes, when all first-order formulae which are valid in such universes are taken as axioms. We prove a general Theorem of...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148931 |