Syntactic characterization of closure under connected limits
From MaRDI portal
Publication:1210580
DOI10.1007/BF01387765zbMath0781.03027MaRDI QIDQ1210580
Publication date: 25 August 1993
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
68P15: Database theory
68Q65: Abstract data types; algebraic specification
18A35: Categories admitting limits (complete categories), functors preserving limits, completions
03C68: Other classical first-order model theory
Related Items
Syntactic characterizations of closure under pullbacks and of locally polypresentable categories, On abstract data types presented by multiequations, Quasi-coproducts and accessible categories with wide pullbacks
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