On the existence of free models in abstract algebraic institutions

DOI10.1016/0304-3975(85)90094-5zbMath0608.68014OpenAlexW1971240584MaRDI QIDQ1085969

Andrzej Tarlecki

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90094-5

zbMATH Keywords

partial algebrasforgetful functorsabstract algebraic institutionsfree functorslogical system for writing specificationsspecifications of abstract data types

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Data structures (68P05) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (30)

Foundations of logic programming in hybrid logics with user-defined sharing ⋮ Observational logic, constructor-based logic, and their duality. ⋮ Algebraic-coalgebraic specification in CoCASL ⋮ Interpolation in Grothendieck institutions ⋮ On observational equivalence and algebraic specification ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Quasi-varieties in abstract algebraic institutions ⋮ Ultraproducts and possible worlds semantics in institutions ⋮ Quasi-Boolean encodings and conditionals in algebraic specification ⋮ Category-based modularisation for equational logic programming ⋮ Herbrand theorems in arbitrary institutions ⋮ Specifications in an arbitrary institution ⋮ An institution-independent proof of the Robinson consistency theorem ⋮ Some general results about proof normalization ⋮ May I borrow your logic? (Transporting logical structures along maps) ⋮ Interpolation for predefined types ⋮ Foundations for structuring behavioural specifications ⋮ Preservation in many-valued truth institutions ⋮ Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras ⋮ Partialising institutions ⋮ An axiomatic approach to structuring specifications ⋮ Some fundamental algebraic tools for the semantics of computation. III: Indexed categories ⋮ Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally ⋮ On the algebra of structured specifications ⋮ Structural induction in institutions ⋮ Saturated models in institutions ⋮ An institution-independent proof of the Beth definability theorem ⋮ Interpolation and compactness in categories of pre-institutions ⋮ Relating CASL with other specification languages: the institution level. ⋮ Implicit Partiality of Signature Morphisms in Institution Theory

Uses Software

• ML

Cites Work

• Algebraic and operational semantics of specifications allowing exceptions and errors
• Characterizing specification languages which admit initial semantics
• On hierarchies of abstract data types
• Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
• Quasi-varieties in abstract algebraic institutions
• Final algebra semantics and data type extensions
• Partial abstract types
• A theory of type polymorphism in programming
• Model theory
• Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
• Axioms for abstract model theory
• Initial Algebra Semantics and Continuous Algebras
• INJECTIVITY IN CATEGORIES TO REPRESENT ALL FIRST ORDER FORMULAS, I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the existence of free models in abstract algebraic institutions