Skip to main content
SpringerLink
Log in

Quasi-equational logic for partial algeras

  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1981)

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

Included in the following conference series:

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. H. Andréka, P. Burmeister, I. Németi. Quasivarieties of partial algebras — A unifying approach towards a two-valued model theory for partial algebras. Preprint Nr. 557, Technische Hochschule Darmstadt, Fachbereich Mathematik, 1980.

    Google Scholar 

  2. H. Andréka, I. Németi. Generalization of variety and quasivariety concept to partial algebras through category theory. MKI Budapest, Preprint 1976/5; to appear in Dissertationes Mathematicae No. 204.

    Google Scholar 

  3. P. Burmeister. Free partial algebras. J. reine u. angewandte Math. 241, 1970, pp. 75–86.

    Google Scholar 

  4. P. Burmeister. Primitive Klassen partieller Algebren. Habilitationsschrift, Bonn, 1971.

    Google Scholar 

  5. P. Burmeister. Partial algebras — Survey of a unifying approach towards a two-valued model theory for partial algebras. Preprint Nr. 582, Technische Hochschule Darmstadt, Fachbereich Mathematik, 1981.

    Google Scholar 

  6. C. C. Chang, H. J. Keisler. Model Theory.North-Holland, 1973.

    Google Scholar 

  7. P. M. Cohn. Universal Algebra. Harper & Row, 1965.

    Google Scholar 

  8. H.-D. Ebbinghaus. Über eine Prädikatenlogik mit partiell definierten Prädikaten und Funktionen. Archiv f. math. Logik 12, 1969, pp. 39–53.

    Google Scholar 

  9. G. A. Edgar. The class of topological spaces is equationally definable. Algebra universalis 3, 1973, pp. 139–146.

    Google Scholar 

  10. J. A. Goguen, J. Meseguer. Completeness of many-sorted equational logic. Manuscript 1981.

    Google Scholar 

  11. H. Höft. Weak and strong equations in partial algebras. Algebra universalis 3, 1973, pp. 203–215.

    Google Scholar 

  12. R. John. Gültigkeitsbegriffe für Gleichungen in partiellen Algebren. Math. Zeitschrift 159, 1978, pp. 25–35.

    Google Scholar 

  13. A. I. Mal'cev. Algebraic Systems. Springer-Verlag, 1973.

    Google Scholar 

  14. I. Németi, I. Sain. Cone-implicational subcategories and some Birkhoff-type theorems. Contributions to Universal Algebra (Proc. Coll. Esztergom 1977) Colloq. Math. Soc. J. Bolyai, North Holland, to appear.

    Google Scholar 

  15. J. Słomiński. Peano-algebras and quasi-algebras. Dissertationes Mathematicae (Rozprawy Mat.) 62, 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, AG 1, Technische Hochschule, Schloßgartenstr. 7, D-6100, Darmstadt, Fed. Rep. of Germany

    Peter Burmeister

Authors
  1. Peter Burmeister
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burmeister, P. (1981). Quasi-equational logic for partial algeras. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation