@incollection{CerioliMossakowskiReichel99,
  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 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. },
  added-at = {2016-08-05T15:59:03.000+0200},
  author = {Cerioli, M. and Mossakowski, T. and Reichel, H.},
  biburl = {https://www.bibsonomy.org/bibtex/2fbef6f7f1c982d084e18eece2838c88f/tillmo},
  booktitle = {Algebraic Foundations of Systems Specifications},
  editor = {Astesiano, E. and Kreowski, H.-J. and Krieg-Br{\"u}ckner, B.},
  interhash = {32300973f14e90cb316a7f4606cb2a33},
  intrahash = {fbef6f7f1c982d084e18eece2838c88f},
  keywords = {imported},
  pages = {31--104},
  publisher = {Springer Verlag, London},
  series = {IFIP State-of-the-Art Reports},
  status = {Reviewed},
  timestamp = {2016-08-05T15:59:03.000+0200},
  title = {From total equational to partial first order logic},
  year = 1999
}