## From Total Equational to Partial First Order Logic (1998)

Citations: | 19 - 8 self |

### BibTeX

@MISC{Cerioli98fromtotal,

author = {Maura Cerioli and Till Mossakowski and Horst Reichel},

title = {From Total Equational to Partial First Order Logic},

year = {1998}

}

### OpenURL

### Abstract

The focus of this chapter is the incremental presentation of partial firstorder 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 described in full detail. Alternatives to partiality, like (variants of) error algebras and order-sortedness are also discussed, showing their uses and limitations. Moreover, both the total and the partial (positive) conditional fragment are investigated in detail, and in particular the existence of initial (free) models for such restricted logical paradigms is proved. Some more powerful algebraic frameworks are sketched at the end. Equational specifications introduced in last chapter, are a powerful tool to represent the most common data types used in programming languages and their semantics. Indeed, Bergstra and Tucker have shown in a series of papers (see [BT87] for a complete exposition of results) that a data type is semicompu...