【24h】

Completing Categorical Algebras (Extended Abstract)

机译:完成分类代数(扩展摘要)

获取原文
获取原文并翻译 | 示例

摘要

Let Σ be a ranked set. A categorical Σ-algebra, cΣa for short, is a small category C equipped with a functor σ_C : C~n →C, for each σ ∈ Σ_n, n ≥ 0. A continuous categorical Σ-algebra is a cΣa which has an initial object and all colimits of ω-chains, i.e., functors N→C; each functor σ_C preserves colimits of ω-chains. (N is the linearly ordered set of the nonnegative integers considered as a category as usual.) We prove that for any cΣa C there is an ω-continuous cΣa C~ω, unique up to equivalence, which forms a "free continuous completion" of C. We generalize the notion of inequation (and equation) and show the inequations or equations that hold in C also hold in C~ω. We then find examples of this completion when 1. C is a cΣa of finite Σ-trees 2. C is an ordered Σ algebra 3. C is a cΣa of finite A-sychronization trees 4. C is a cΣa of finite words on A.
机译:令Σ为排名集。类别Σ代数,简称cΣa,是一个配备有函子σ_C的小类别C:C〜n→C,对于每个σ∈Σ_n,n≥0。对象和ω链的所有共限,即函子N→C;每个函子σ_C保留ω链的共极限。 (N是通常视为类别的非负整数的线性有序集合。)我们证明,对于任何cΣaC,都有一个ω-连续cΣaC〜ω,直到等价为止都是唯一的,从而形成“自由连续完成”我们推广了不等式(和等式)的概念,并证明了包含在C中的不等式或方程式也包含在C〜ω中。然后,我们在1.时发现此完成的示例。C是有限Σ-树的cΣa2. C是有序Σ代数3. C是有限A同步树的cΣa4. C是A上有限词的cΣa 。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号