Syntactic characterization of closure under connected limits

DOI10.1007/BF01387765zbMath0781.03027MaRDI QIDQ1210580

Michel Hebert

Publication date: 25 August 1993

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

pullbackssubstructuresconnected limitscategories of modelsinitial structure

Mathematics Subject Classification ID

Database theory (68P15) Abstract data types; algebraic specification (68Q65) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Other classical first-order model theory (03C68)

Related Items (3)

Syntactic characterizations of closure under pullbacks and of locally polypresentable categories ⋮ Quasi-coproducts and accessible categories with wide pullbacks ⋮ On abstract data types presented by multiequations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the fullness of certain functors
• Why Horn formulas matter in computer science: initial structures and generic examples
• Categories localement multipresentables
• On full embeddings. I
• Some spectra relative to functors
• Model theory
• Lokal präsentierbare Kategorien. (Locally presentable categories)
• Characterizations of Axiomatic Categories of Models Canonically Isomorphic to (Quasi-)Varieties
• Preservation and Interpolation Through Binary Relations Between Theories
• Accessible Categories: The Foundations of Categorical Model Theory
• The decision problem for some classes of sentences without quantifiers

This page was built for publication: Syntactic characterization of closure under connected limits