Skip to main content

Synthesis and complexity of logical systems

  • Submitted Abstract
  • Conference paper
  • First Online:
Book cover Category Theory Applied to Computation and Control

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

  • 2034 Accesses

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. Birkhoff, G., and Lipson, J.D.: Heterogeneous algebras, J. Combinatorial Theory 8, 1970, 115–133.

    MathSciNet  Google Scholar 

  2. Budach, L., and Hoehnke, H.-J.: Automaten und Funktoren, Berlin, 1974.

    Google Scholar 

  3. Higgins, P.J.: Algebras with a scheme of operators, Math. Nachr. 27, 1963, 115–132.

    MathSciNet  Google Scholar 

  4. Hoehnke, H.-J.: Struktursätze der Algebra und Kompliziertheit logischer Schemata, Math. Nachr. (im Druck), 1974a.

    Google Scholar 

  5. Hoehnke, H.-J.: Kompliziertheit Boolescher Schaltkreise, Math. Nachr. (im Erscheinen), 1974b.

    Google Scholar 

  6. Kaphengst, H., and Reichel, H.: Operative Theorien und Kategorien von operativen Systemen, Studien zur Algebra und ihre Anwendungen, Berlin, 1972.

    Google Scholar 

  7. Kobrinski, N.E., and Trachtenbrot, B.A.: Einführung in die Theorie endlicher Automaten, Berlin, 1967.

    Google Scholar 

  8. Lambek, J.: Functional completeness of cartesian categories, Preprint, Montréal, 1973.

    Google Scholar 

  9. Pöschel, R.: Postsche Algebren von Funktionen über einer Familie end-licher Mengen, Z. Math. Logik Grundlagen Math. 19, 1973, 37–74.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ernest Gene Manes

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoehnke, HJ. (1975). Synthesis and complexity of logical systems. In: Manes, E.G. (eds) Category Theory Applied to Computation and Control. Lecture Notes in Computer Science, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07142-3_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-07142-3_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37426-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics