arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.15090cs.ITcs.LOmath.ITmath.RT
收藏

交换信息代数:表示与对偶理论

Commutative Information Algebras: Representation and Duality Theory

Juerg Kohlas, Juerg Schmid

摘要:

信息代数起源于这样一种思想,即信息以碎片的形式出现,这些碎片可以聚合或组合成新的碎片,信息涉及问题,并且从任何信息中,可以提取与给定问题相关的部分。这导致了某种类型的代数结构,基本上是赋予了额外的一元运算的半格。这些运算本质上是基础半格上的(对偶)存在量词。这种代数的原型实例是某些论域的子集的半格,以及与这个论域上的等价关系族相关联的饱和算子。这样的代数在我们的上下文中称为{ \em集代数}。我们的第一个结果是一个基本的表示定理:每个抽象信息代数同构于一个集合代数。当涉及到组合信息片段时,对逻辑连接词{ \em and}、{ \em or}或{ \em not}进行建模的想法是非常自然的。因此,我们特别感兴趣的信息代数的基础半格是一个格,典型的分配甚至布尔。因此,本文的一个主要部分是致力于发展明确的一个成熟的自然对偶理论,延长石分别。Priestley对偶以一种合适的方式考虑了附加运算.

英文摘要:

Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given question can be extracted. This leads to a certain type of algebraic structures, basically semilattices endowed with with additional unary operations. These operations essentially are (dual) existential quantifiers on the underlying semilattice. The archetypical instances of such algebras are semilattices of subsets of some universe, together with the saturation operators associated with a family of equivalence relations on this universe. Such algebras will be called {\em set algebras} in our context. Our first result is a basic representation theorem: Every abstract information algebra is isomorphic to a set algebra. When it comes to combine pieces of information, the idea to model the logical connectives {\em and}, {\em or} or {\em not} is quite natural. Accordingly, we are especially interested in information algebras where the underlying semilattice is a lattice, typically distributive or even Boolean. A major part of this paper is therefore devoted to developing explicitly a full-fledged natural duality theory extending Stone resp. Priestley duality in a suitable way in order to take into account the additional operations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑