Skip to main content
SpringerLink
Log in

Equational calculi for many-sorted algebras with empty carrier sets

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 452))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burmeister P., A Model Theoretic Oriented Approach to Partial Algebras, Akademie-Verlag, Berlin, 1986.

    Google Scholar 

  2. Ehrig H., Loeckx J. and Mahr B., A Remark on the Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets, Bulletin of the EATCS, n.30, October 1986.

    Google Scholar 

  3. Ehrig H. and Mahr B., Fundamentals of Algebraic Specifications 1: Equations and Initial Semantics. Springer Verlag, 1985.

    Google Scholar 

  4. Goguen J.A. and Meseguer J., Completeness of Many-Sorted Equational Logic, Houston Journal of Mathematics, Vol.11, n.3, 1985, 307–334.

    Google Scholar 

  5. Meseguer J. and Goguen J.A., Initiality, Induction and Computability, in M. Nivat and J.C. Reynolds (Eds.) Algebraic Methods in Semantics, Cambridge University Press, 1985, 459–541.

    Google Scholar 

  6. Goguen J.A. and Meseguer J., Remarks on Remarks on Many-Sorted Equational Logic, Bulletin of the EATCS, n. 30, October 1986.

    Google Scholar 

  7. Grätzer G., Universal Algebra, Springer Verlag, 1979, second edition.

    Google Scholar 

  8. Huet G. and Oppen D.C., Equations and Rewrite Rules: a Survey, in R. Book (Ed.), Formal Language Theory: Perspective and Open Problems, Academic Press, 1980, 349–405.

    Google Scholar 

  9. Manca V. and Salibra A., Soundness and Completeness of the Birkhoff Many-Sorted Equational Calculus with Possibly Empty Carrier Sets, submitted to Theoretical Computer Science.

    Google Scholar 

  10. Markusz Z., On Many-sorted Logic, in Communications of Computer Science, Inst. of Hungarian Acad. Sci., 1983.

    Google Scholar 

  11. Markusz Z., Validity Concepts for Many-sorted Logic Allowing Empty Sorts, in Communications of Computer Science, Inst. of Hungarian Acad. Sci., 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Informatica, Università di Pisa, Corso Italia 40, I-56100, Pisa, Italy

    Vincenzo Manca & Antonino Salibra

  2. Dip. di Matematica e Informatica, Università di Udine, Via Zanon 6, I-33100, Udine, Italy

    Vincenzo Manca

Authors
  1. Vincenzo Manca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonino Salibra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manca, V., Salibra, A. (1990). Equational calculi for many-sorted algebras with empty carrier sets. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029638

Download citation

  • DOI: https://doi.org/10.1007/BFb0029638

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation