Abstract
We introduce the notion of generic examples as a unifying principle for various phenomena in computer science such as initial structures in the area of abstract data types and Armstrong relations in the area of data bases. Generic examples are also useful in defining the semantics of logig programming, in the formal theory of program testing and in complexity theory. We characterize initial structures in terms of their generic properties and give a syntactic characterization of first order theories admitting initial structures. The latter can be used to explain why Horn formulas have gained a predominant role in various areas of computer science.
Chapter PDF
Similar content being viewed by others
References
Goguen, J.A., Thatcher, J.W., Wagner, E.G. and Wright, J.A.; Abstract data types as initial algebras and the correctness of data representations, Proc. of Conf. on Computer Graphics, Pattern Recognition and Data Structures, 1975, pp. 89–93.
Armstrong, W.W.; Dependency structures of database relationships Proc. IFIP 74, North Holland 1974, pp. 580–583.
Börger, E.; Decision problems in predicate logic, in: Logic Colloquium '82, G. Lolli, G. Longo and Am Marcja eds., North Holland 1984, pp. 263–302.
Chang, C.C. and Keisler, H.J.; Model Theory, North Holland 1973.
Chandrasekaran, B. and Radicchi, S.; Computer Program Testing, North Holland 1981.
Fagin, R.; Horn Clauses and data base dependencies, J.ACM vol. 29 (1982) pp. 252–285.
Goguen, J.A. and Burstall, R.M., Introducing institutions, in Proc. of Logic Programming Workshop, E. Clarke ed., Lecture Notes of Computer Science 1984, to appear.
Kreisel, G. and Krivine, J.L.; Elements de logique mathematique, Dunod 1966.
Kowalski,R.; Logic for Problem solving, North Holland 1979.
McKinsey, J.C.C.; The decision problem for some classes of sentences without quantifiers, Journal of Smb. Logic vol. 8 (1943) pp. 61–76.
Mal'cev, A.; Quasi primitive classes of abstract algebras, in: The Metamathematics of algebraic systems, collected papers of A.I. Mal'cev, North Holland 1971, pp. 27–31.
Mahr, B. and Makowsky, J.A.; Characterizing specification languages which admit initial semantics, Proc. of 8th CAAP, Springer LNCS vol. 159 (1983) pp. 300–316.
Makowsky, J.A. and Vardi, M.Y.; On the expressive power of data dependencies, submitted 1984.
Makowsky, J.A.; Model theoretic issues in Computer Science, Part I: Relational data bases and abstract data types, in: Logic Colloquium '82, G. Lolli, G. Longo and A. Marcja eds., North Holland 1984, pp. 303–344.
Mostowski, A.; Review of [Mal56], Journal of Symb. Logic vol. 24 (1959) p. 57.
Rabin, M.; Characterization of convex systems of axioms, Notices AMS, Abstract 571–65 (1960) p. 505.
Rabin M.; Classes of models and sets of sentences with the intersection property, Ann.Fac.Sci. Universite de Clermont, vol. 7.1 (1962) pp. 39–53.
Robinson, A.; Introduction to model theory and the Metamathematics of algebra, North Holland 1963.
Smorynski, C.; Lectures on non-standard models of arithmetic, in Logic Colloquium '82, Lolli, G. Longo, G. and Marcja, A. eds., North Holland 1984, pp. 1–70.
Strassen, V.; Polynomials with rational coefficients which are hard to compute, SIAM J.Comput. vol. 3.2 (1974) pp. 128–149.
Tarski, A.; Some notions and methods on the borderline of algebra and metamathematics, Proc.Int.Congr.of Mathe., Cambridge, MA vol. 1 (1952) pp. 705–720.
Tarlecki, A.; Free constructions in abstract algebraic institutions, draft February 1984.
Tarnlund, S.A.; Horn clause computability, BIT vol. 17 (1977) pp. 215–226.
Zloof, M.M.; Office-by-example: A business language that unifies data and word processing and electronic mail, IBM Syst.J. vol. 21.3 (1982) pp. 272–304.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makowsky, J.A. (1985). Why Horn formulas matter in computer science: Initial structures and generic examples. In: Ehrig, H., Floyd, C., Nivat, M., Thatcher, J. (eds) Mathematical Foundations of Software Development. CAAP 1985. Lecture Notes in Computer Science, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15198-2_24
Download citation
DOI: https://doi.org/10.1007/3-540-15198-2_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15198-2
Online ISBN: 978-3-540-39302-3
eBook Packages: Springer Book Archive