Preview
Unable to display preview. Download preview PDF.
References
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.
Andréka, H. Gergely, T. Németi, I., On universal algebraic construction of logics. Studia Logica 36, 1977, Nr.1–2, pp.9–47.
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.
Andréka,H. Gergely,T. Németi,I., Investigations in Language Hierarchies. Preprint, Research Inst. for Applied Comp. Sci. 1980.
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.
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.
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.
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.
Andréka,H. Németi,I. Sain,I., Henkin type model theory for first order dynamic logic. Preprint, 1980.
Andréka,H. Németi,I. Sain,I., Relativization of dynamic algebras a tool for decomposition of dynamic theories. Preprint, 1980.
Bergstra,J.A. Tiuryn,J. Tucker,J.V., Correctness theories and program equivalence. Mathematisch Centrum Preprint IW 119/79, Amsterdam 1979.
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.
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.
Burmeister,P., Partial algebras — Survey of a unifying approach towards a two-valued model theory for partial algebras. Preprint 1980.
Burstall,R. Darlington,J., A system which automatically improves programs. Proc. 3rd IJCAI, S.R.I. 1973, pp.537–542.
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.
Courcelle, B. Guessarian, I., On some classes of interpretations. J. of Computer and System Sciences 17, 1978, pp.388–413.
Csirmaz,L., Programs and program verifications in a general setting. Theoretical Computer Science, to appear.
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.
Gergely,T., Algebraic Representation of Language Hierarchies. Preprint, Research Inst. for Applied Comp. Sci. 1981. Acta Cybernetica, to appear.
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.
Goguen,J.A., Some ideas in algebraic semantics. Proceedings, 3rd IBM Symposium on Math.Foundations of Comp. Sci. (Kobe Japan).
Grätzer, G., Universal algebra. (Second Edition) Springer Verlag, New York, 1979.
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.
Hupbach,U.L., A uniform mathematical framework for initial algebraic specifications. Preprint VEB ROBOTRON Zentrum für Forschung und Technik, 1979.
Kozen, D., A representation theorem for models of *-free PDL. Report RC7864, IBM Research, Yorktown Heights, New York, 1979.
Lehmann,D. Pasztor,A., On a conjecture of Meseguer. Theoretical Computer Science, to appear.
Mal'cev,A.I., Algebraic systems. Springer Verlag Berlin, 1973.
Nelson,E., Z-continuous algebras. Preprint McMaster University, 1980.
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.
Németi,I., Nonstandard runs of Floyd-provable programs. Submitted to Proc. Conf. Algorithmic Logic 1980 (Poznan).
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.
Pasztor,A., Characterization of epis of continuous algebras. Proc.Coll. Categorical and algebraic methods in computer science and system theory (3rd Workshop) Dortmund, 1980.
Pasztor, A., Faktorisierungssysteme in der Kategorie der partiellen Algebren — Kennzeichnung von (Homo-)Morphismenklassen. Hochschul Sammlung Naturwissenschaften Mathematik Band 1, Hochschul Verlag, Freiburg, 1979.
Pratt,V.R., Dynamic algebras: examples, constructions, applications. Report MIT/LCS/TM-138. July 1979.
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.
Sain,I., Ultraproducts in theoretical computer science. Seminar notes SZKI 1980, and Lecture notes of NJSZT summer school Siófok 1980.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights 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