Skip to main content
SpringerLink
Log in

Some universal algebraic and model theoretic results in computer science

  • Conference paper
  • First Online:
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. Andréka,H. Burmeister,P. Németi,I., Quasivarieties of Partial Algebras — A unifying approach towards a two-valued model theory for partial algebras. Preprint Nr.557, Technische Hochschule Darmstadt, Fachbereich Mathematics. July 1980.

    Google Scholar 

  2. Andréka, H. Gergely, T. Németi, I., On universal algebraic construction of logics. Studia Logica 36, 1977, Nr.1–2, pp.9–47.

    Google Scholar 

  3. Andréka,H. Gergely,T. Németi,I. Sain,I., Theory morphisms, stepwise refinement of program specifications, representation of knowladge, and cylindric algebras. Preprint, June 1980.

    Google Scholar 

  4. Andréka,H. Gergely,T. Németi,I., Investigations in Language Hierarchies. Preprint, Research Inst. for Applied Comp. Sci. 1980.

    Google Scholar 

  5. Andréka,H. Németi,I., Applications of universal algebra, model theory, and categories in computer science. Survey and bibliography, parts I–III. Part I in CL&CL — Comput. Ling. Comput. Lang. Vol.XIII (1979), Part II in CL&CL — Comput. Ling. Comput. Lang. Vol.XIV (1980), Part III as Preprint Math.Inst.Hung.Acad.Sci. 1980.

    Google Scholar 

  6. Andréka,H. Németi,I., Generalization of variety and quasivariety concept to partial algebras through category theory. Preprint Math.Inst.Hung.Acad.Sci. No.1976/5. Dissertationes Mathematicae (Rozprawy) No.204. In press.

    Google Scholar 

  7. Andréka,H. Németi,I., Every free algebra in the variety generated by the representable dynamic algebras is separable and representable. Theoretical Computer Science, to appear.

    Google Scholar 

  8. Andréka,H. Németi,I. Sain,I., Representable dynamic algebras are not first order axiomatizable and other considerations on the representation theory of dynamic algebras. Preprint, 1980.

    Google Scholar 

  9. Andréka,H. Németi,I. Sain,I., Henkin type model theory for first order dynamic logic. Preprint, 1980.

    Google Scholar 

  10. Andréka,H. Németi,I. Sain,I., Relativization of dynamic algebras a tool for decomposition of dynamic theories. Preprint, 1980.

    Google Scholar 

  11. Bergstra,J.A. Tiuryn,J. Tucker,J.V., Correctness theories and program equivalence. Mathematisch Centrum Preprint IW 119/79, Amsterdam 1979.

    Google Scholar 

  12. Bertoni,A. Mauri,G. Miglioli,P.A. Wirsing,M., On different approaches to abstract data types and the existence of recursive models. Bulletin of the European Association for Theoretical Computer Science EATCS 9, pp.47–57.

    Google Scholar 

  13. Broy,M. Wirsing,M., Algebraic definition of a functional programming language and its semantic models. Preprint Technische Universität München TUM-I8008, June 1980.

    Google Scholar 

  14. Burmeister,P., Partial algebras — Survey of a unifying approach towards a two-valued model theory for partial algebras. Preprint 1980.

    Google Scholar 

  15. Burstall,R. Darlington,J., A system which automatically improves programs. Proc. 3rd IJCAI, S.R.I. 1973, pp.537–542.

    Google Scholar 

  16. Burstall,R. Goguen,J.A., The semantics of CLEAR, a specification language. Abstract Software Specifications (1979 Copenhagen Winter School Proceedings) Ed.: D.Bjørner. Lecture Notes in Computer Science Vol.86, Springer Verlag Berlin, pp.292–333.

    Google Scholar 

  17. Courcelle, B. Guessarian, I., On some classes of interpretations. J. of Computer and System Sciences 17, 1978, pp.388–413.

    Google Scholar 

  18. Csirmaz,L., Programs and program verifications in a general setting. Theoretical Computer Science, to appear.

    Google Scholar 

  19. Dömölki,B., An example of hierarchical program specification. Abstract Software Specifications (1979 Copenhagen Winter School Proceedings) Ed.: D.Bjørner. Lecture Notes in Computer Science Vol.86, Springer Verlag Berlin, pp.333–353.

    Google Scholar 

  20. Gergely,T., Algebraic Representation of Language Hierarchies. Preprint, Research Inst. for Applied Comp. Sci. 1981. Acta Cybernetica, to appear.

    Google Scholar 

  21. Gergely,T. Úry,L., Program behaviour specification through explicit time consideration. Information Processing 80. Ed.: S.H. Lavington. North Holland Publ. Co. IFIP, 1980, pp.107–111.

    Google Scholar 

  22. Goguen,J.A., Some ideas in algebraic semantics. Proceedings, 3rd IBM Symposium on Math.Foundations of Comp. Sci. (Kobe Japan).

    Google Scholar 

  23. Grätzer, G., Universal algebra. (Second Edition) Springer Verlag, New York, 1979.

    Google Scholar 

  24. Hupbach,U.L., Abstract implementation of abstract data type. MFCS'80 Proceedings of the 8th Symp. on Mathematical Foundations of Computer Science (Rydzina-Zamek, Poland 1980). Lecture Notes in Computer Science, Springer Verlag, 1980.

    Google Scholar 

  25. Hupbach,U.L., A uniform mathematical framework for initial algebraic specifications. Preprint VEB ROBOTRON Zentrum für Forschung und Technik, 1979.

    Google Scholar 

  26. Kozen, D., A representation theorem for models of *-free PDL. Report RC7864, IBM Research, Yorktown Heights, New York, 1979.

    Google Scholar 

  27. Lehmann,D. Pasztor,A., On a conjecture of Meseguer. Theoretical Computer Science, to appear.

    Google Scholar 

  28. Mal'cev,A.I., Algebraic systems. Springer Verlag Berlin, 1973.

    Google Scholar 

  29. Nelson,E., Z-continuous algebras. Preprint McMaster University, 1980.

    Google Scholar 

  30. Németi,I., Some constructions of cylindric algebra theory applied to dynamic algebras of programs. CL&CL — Comput. Ling. Comput. Lang. Vol.XIV, to appear.

    Google Scholar 

  31. Németi,I., Nonstandard runs of Floyd-provable programs. Submitted to Proc. Conf. Algorithmic Logic 1980 (Poznan).

    Google Scholar 

  32. Németi,I., Connections between cylindric algebras and initial algebra semantics of CF languages. Mathematical Logic in Computer Science (Proc.Coll. Salgótarján 1978) Colloq.Math.Soc.J.Bolyai Vol.26, North-Holland. Eds.: B.Dömölki, T.Gergely. pp.561–606.

    Google Scholar 

  33. Pasztor,A., Characterization of epis of continuous algebras. Proc.Coll. Categorical and algebraic methods in computer science and system theory (3rd Workshop) Dortmund, 1980.

    Google Scholar 

  34. Pasztor, A., Faktorisierungssysteme in der Kategorie der partiellen Algebren — Kennzeichnung von (Homo-)Morphismenklassen. Hochschul Sammlung Naturwissenschaften Mathematik Band 1, Hochschul Verlag, Freiburg, 1979.

    Google Scholar 

  35. Pratt,V.R., Dynamic algebras: examples, constructions, applications. Report MIT/LCS/TM-138. July 1979.

    Google Scholar 

  36. Reichel,H., Initially restricting algebraic theories. MFCS'80. Proc. 8th Symp. on Mathematical Foundations of Computer Science (Rydzina-Zamek, Poland), Lecture Notes in Computer Science, Springer Verlag 1980.

    Google Scholar 

  37. Sain,I., Ultraproducts in theoretical computer science. Seminar notes SZKI 1980, and Lecture notes of NJSZT summer school Siófok 1980.

    Google Scholar 

  38. Sain, I., There are general rules for specifying semantics: Observations on abstract model theory. CL&CL — Comput. Ling. Comput. Lang. Vol.XIII, 1979, pp.195–250.

    Google Scholar 

  39. Wirsing,M. Broy,M., Abstract data types as lattices of finitely generated models. MFCS'80, Proc. 8th Symp. on Mathematical Foundations of Computer Science (Rydzina-Zamek, Poland). Lecture Notes in Computer Science, Springer Verlag, 1980.

    Google Scholar 

  40. Wirsing,M. Pepper,P. Partsch,H. Dosch,W. Broy,M., On hierarchies of abstract data types. Preprint Technische Universität München TUM-I8007, May 1980.

    Google Scholar 

  41. Zilles,S.N., Introduction to data algebras. Abstract Software Specifications (1979 Copenhagen Winter School Proceedings), Ed.: D.Bjørner. Lecture Notes in Computer Science Vol.86, Springer Verlag Berlin, pp.248–273.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences Budapest, Reáltanoda u. 13–15, H-1053, Hungary

    H. Andréka & I. Németi

Authors
  1. H. Andréka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Németi
    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

Andréka, H., Németi, I. (1981). Some universal algebraic and model theoretic results in computer science. 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_2

Download citation

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

  • 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