On the existence of free models in abstract algebraic institutions
type: Item
instance of: scholarly article
title: On the existence of free models in abstract algebraic institutions
zbMATH Open document ID: 0608.68014
DOI: 10.1016/0304-3975(85)90094-5
author: Andrzej Tarlecki
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: To provide a formal framework for discussing specifications of abstract data types we restrict the notion of Institution due to \textit{J. A. Goguen} and \textit{R. M. Burstall} [Lect. Notes Comput. Sci. 164, 221-256 (1984; Zbl 0543.68021)] which formalises the concept of a logical system for writing specifications, and deal with abstract algebraic institutions. These are institutions equipped with a notion of submodel which satisfy a number of technical conditions. Our main results concern the problem of the existence of free constructions in abstract algebraic institutions. We generalise a characterisation of algebraic specification languages that guarantee the existence of reachable initial models for any consistent set of axioms given by \textit{B. Mahr} and \textit{J. A. Makowsky} [Theor. Comput. Sci. 31, 49-59 (1984; Zbl 0536.68011)]. Then the more general problem of the existence of free functors (left adjoints to forgetful functors) for any theory morphism is analysed. We give a construction of a free model to a theory over a model of a subtheory (with respect to an arbitrary theory morphism) which requires only the existence of initial models. This yields a characterisation of strongly liberal abstract algebraic institutions. We also show how to specialise there characterisation results for the partial algebras.
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 18C10
zbMATH DE Number: 3984552
zbMATH Keywords: specifications of abstract data types
zbMATH Keywords: logical system for writing specifications
zbMATH Keywords: abstract algebraic institutions
zbMATH Keywords: free functors
zbMATH Keywords: forgetful functors
zbMATH Keywords: partial algebras
describes a project that uses: ML
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90094-5
OpenAlex ID: W1971240584
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Q3666908
cites work: Q3950541
cites work: INJECTIVITY IN CATEGORIES TO REPRESENT ALL FIRST ORDER FORMULAS, I
cites work: Q4063607
cites work: Q4111746
cites work: Axioms for abstract model theory
cites work: Q3947094
cites work: Partial abstract types
cites work: Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
cites work: Q3906394
cites work: Q3667921
cites work: Model theory
cites work: Q3667933
cites work: Algebraic and operational semantics of specifications allowing exceptions and errors
cites work: Q4151143
cites work: Q5416166
cites work: Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
cites work: Q3687683
cites work: Q4200260
cites work: Q4178466
cites work: Q5682456
cites work: Q5639839
cites work: Characterizing specification languages which admit initial semantics
cites work: Q3677149
cites work: Q3235377
cites work: A theory of type polymorphism in programming
cites work: Q3923580
cites work: Q3337524
cites work: Q3345753
cites work: Quasi-varieties in abstract algebraic institutions
cites work: Q3687694
cites work: Final algebra semantics and data type extensions
cites work: On hierarchies of abstract data types
description: scientific article; zbMATH DE number 3984552