Abstract
It is known ( Bergstra and Tucker (1982) J. Comput. System Sci. 25 , 217) that if the Hoare rules are complete for a first-order structure %plane1D;49C;, then the set of partial correctness assertions true over %plane1D;49C; is recursive in the first-order theory of %plane1D;49C;. We show that the converse is not true. Namely, there is a first-order structure %plane1D;49E; such that the set of partial correctness assertions true over %plane1D;49E; is recursive in the theory of %plane1D;49E;, but the Hoare rules are not complete for %plane1D;49E;.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
