On the existence of free models in abstract algebraic institutions

DOI10.1016/0304-3975(85)90094-5zbMath0608.68014MaRDI 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 algebras; forgetful functors; abstract algebraic institutions; free functors; logical system for writing specifications; specifications of abstract data types

Mathematics Subject Classification ID

68Q65: Abstract data types; algebraic specification

68P05: Data structures

18C10: Theories (e.g., algebraic theories), structure, and semantics

Related Items

Interpolation and compactness in categories of pre-institutions, Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras, An institution-independent proof of the Robinson consistency theorem, An institution-independent proof of the Beth definability theorem, On observational equivalence and algebraic specification, Toward formal development of programs from algebraic specifications: Implementations revisited, Quasi-varieties in abstract algebraic institutions, Specifications in an arbitrary institution, Some fundamental algebraic tools for the semantics of computation. III: Indexed categories, May I borrow your logic? (Transporting logical structures along maps), Relating CASL with other specification languages: the institution level., Observational logic, constructor-based logic, and their duality., Interpolation in Grothendieck institutions, Category-based modularisation for equational logic programming, Algebraic-coalgebraic specification in CoCASL, Ultraproducts and possible worlds semantics in institutions

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