Abstract
Besides the description of program properties, programming logics are also expected to provide appropriate tools for proving the existence of these properties at concrete programs. Therefore, an appropriate calculus is required to permit the proof of formulas of the descriptive language. Moreover, we expect this calculus to be realizable in some intuitive sense , i.e. to correspond to our requirement of having an effective proof concept. Completeness of a descriptive language requires the recursive enumerability of the appropriate formulas. On the other hand, concerning the calculus, it is required to enumerate all the appropriate formulas.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gergely, T., Úry, L. (1991). The Problem of Completeness. In: First-Order Programming Theories. EATCS Monographs on Theoretical Computer Science, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58205-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-58205-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63503-8
Online ISBN: 978-3-642-58205-9
eBook Packages: Springer Book Archive