Skip to main content

A more categorical model of universal algebra

  • Section B Computation Theory in Category
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Adámek: Free algebras and automata realizations in the language of categories, Comment. Math. Univ. Carolinae 15/1974/, 589–602.

    Google Scholar 

  2. J. Adámek: Categorical automata theory and universal algebra, Thesis, Charles University, Prague 1975.

    Google Scholar 

  3. M. Barr: Coequalizers and free triples, Math. Z. 116/1970/, 307–322.

    Google Scholar 

  4. V. Koubek and J. Reiterman: Automata and categories: input processes, MFCS 75, Lecture Notes in Computer Science 32, 280–286.

    Google Scholar 

  5. E.G. Manes: Algebraic theories, GTM 26, Springer Verlag 1976.

    Google Scholar 

  6. V. Müller: Algebras and R-algebras, Thesis, Charles University, Prague 1973.

    Google Scholar 

  7. J. Reiterman: A left adjoint construction related to free triples, to appear in J. Pure Appl. Algebra.

    Google Scholar 

  8. J. Reiterman: Categorical algebraic constructions, Thesis, Charles University, Prague 1976.

    Google Scholar 

  9. V. Trnková, J. Adámek, V. Koubek, J. Reiterman: Free algebras, input processes and free monads, Comment. Math. Univ. Carolinae 16/1975/, 339–352.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reiterman, J. (1977). A more categorical model of universal algebra. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_98

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_98

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics