Abstract
The focus of this chapter is the incremental presentation of partial first-order logic, seen as a powerful framework where the specification of most data types can be directly represented in the most natural way. Both model theory and logical deduction are fully described. Alternatives to partiality, like (variants of) error algebras and order-sortedness, are also discussed, emphasizing their uses and limitations. Moreover, both the total and the partial (positive) conditional fragments are investigated in detail, and in particular the existence of initial (free) models for such restricted logical paradigms is proved. Finally some more powerful algebraic frameworks are sketched.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Cerioli, M., Mossakowski, T., Reichel, H. (1999). From Total Equational to Partial First-Order Logic. In: Astesiano, E., Kreowski, HJ., Krieg-Brückner, B. (eds) Algebraic Foundations of Systems Specification. IFIP State-of-the-Art Reports. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59851-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-59851-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64151-0
Online ISBN: 978-3-642-59851-7
eBook Packages: Springer Book Archive