Abstract
Our main objective in this part is the development of a theory based on classical first-order logic which can serve as the foundation for a logic-based programming theory. Namely, this theory should deal with programs and with their logically meaningful semantics, and should also provide purely logical tools to extend programming languages with new computation devices or data structures. This theory should also be appropriate to investigate the programming languages for example from the viewpoint of their computational power, and to provide them with a sharp logical characterization.
This is a preview of subscription content, log in via an institution to check access.
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). Introduction to Part I. 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_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-58205-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63503-8
Online ISBN: 978-3-642-58205-9
eBook Packages: Springer Book Archive