条件/决策对偶性与广义限制范畴的内在逻辑

Q3 Computer Science
Robin Kaarsgaard
{"title":"条件/决策对偶性与广义限制范畴的内在逻辑","authors":"Robin Kaarsgaard","doi":"10.1016/j.entcs.2019.09.010","DOIUrl":null,"url":null,"abstract":"<div><p>In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as <em>conditions</em>, <em>i.e.</em>, expressions which are easily combined with other conditions (often via Boolean combinators) to form new conditions, though they only play a supporting role in aiding branching statements choose a branch to follow. On the other hand, in the graphical representation they are typically presented as <em>decisions</em>, intrinsically capable of directing control flow yet mostly oblivious to Boolean combination.</p><p>While categorical treatments of flowchart languages are abundant, none of them provide a treatment of this dual nature of predicates. In the present paper, we argue that extensive restriction categories are precisely categories that capture such a condition/decision duality, by means of morphisms which, coincidentally, are also called decisions. Further, we show that having these categorical decisions amounts to having an internal logic: Analogous to how subobjects of an object in a topos form a Heyting algebra, we show that decisions on an object in an extensive restriction category form a <em>De Morgan quasilattice</em>, the algebraic structure associated with the (three-valued) <em>weak Kleene logic</em> <span><math><msubsup><mrow><mi>K</mi></mrow><mrow><mn>3</mn></mrow><mrow><mi>w</mi></mrow></msubsup></math></span>. Full classical propositional logic can be recovered by restricting to <em>total</em> decisions, yielding extensive categories in the usual sense, and confirming (from a different direction) a result from effectus theory that predicates on objects in extensive categories form Boolean algebras.</p><p>As an application, since (categorical) decisions are partial isomorphisms, this approach provides naturally reversible models of classical propositional logic and weak Kleene logic.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"347 ","pages":"Pages 179-202"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.010","citationCount":"5","resultStr":"{\"title\":\"Condition/Decision Duality and the Internal Logic of Extensive Restriction Categories\",\"authors\":\"Robin Kaarsgaard\",\"doi\":\"10.1016/j.entcs.2019.09.010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as <em>conditions</em>, <em>i.e.</em>, expressions which are easily combined with other conditions (often via Boolean combinators) to form new conditions, though they only play a supporting role in aiding branching statements choose a branch to follow. On the other hand, in the graphical representation they are typically presented as <em>decisions</em>, intrinsically capable of directing control flow yet mostly oblivious to Boolean combination.</p><p>While categorical treatments of flowchart languages are abundant, none of them provide a treatment of this dual nature of predicates. In the present paper, we argue that extensive restriction categories are precisely categories that capture such a condition/decision duality, by means of morphisms which, coincidentally, are also called decisions. Further, we show that having these categorical decisions amounts to having an internal logic: Analogous to how subobjects of an object in a topos form a Heyting algebra, we show that decisions on an object in an extensive restriction category form a <em>De Morgan quasilattice</em>, the algebraic structure associated with the (three-valued) <em>weak Kleene logic</em> <span><math><msubsup><mrow><mi>K</mi></mrow><mrow><mn>3</mn></mrow><mrow><mi>w</mi></mrow></msubsup></math></span>. Full classical propositional logic can be recovered by restricting to <em>total</em> decisions, yielding extensive categories in the usual sense, and confirming (from a different direction) a result from effectus theory that predicates on objects in extensive categories form Boolean algebras.</p><p>As an application, since (categorical) decisions are partial isomorphisms, this approach provides naturally reversible models of classical propositional logic and weak Kleene logic.</p></div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"347 \",\"pages\":\"Pages 179-202\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.entcs.2019.09.010\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066119301264\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066119301264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 5

摘要

在流程图语言中,谓词扮演着有趣的双重角色。在文本表示中,它们通常表现为条件,即表达式,这些表达式很容易与其他条件(通常通过布尔组合子)组合以形成新的条件,尽管它们仅在帮助分支语句选择要遵循的分支方面发挥支持作用。另一方面,在图形表示中,它们通常被表示为决策,本质上能够指导控制流,但大多忽略了布尔组合。虽然对流程图语言的分类处理是丰富的,但它们都没有提供对谓词的这种双重性质的处理。在本文中,我们论证了广泛的限制范畴正是捕捉这种条件/决策对偶的范畴,通过态射,巧合的是,也称为决策。进一步,我们证明了拥有这些范畴决策相当于拥有一个内部逻辑:类似于拓扑中对象的子对象如何形成Heyting代数,我们证明了在广泛限制范畴中对象的决策形成了一个De Morgan拟格,这是与(三值)弱Kleene逻辑K3w相关的代数结构。完整的经典命题逻辑可以通过限制总的决定,产生通常意义上的广泛范畴,并确认(从不同的方向)效应理论的结果,即在广泛范畴中的对象上的谓词形成布尔代数来恢复。作为一种应用,由于(范畴)决策是部分同构的,这种方法提供了经典命题逻辑和弱Kleene逻辑的自然可逆模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Condition/Decision Duality and the Internal Logic of Extensive Restriction Categories

In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as conditions, i.e., expressions which are easily combined with other conditions (often via Boolean combinators) to form new conditions, though they only play a supporting role in aiding branching statements choose a branch to follow. On the other hand, in the graphical representation they are typically presented as decisions, intrinsically capable of directing control flow yet mostly oblivious to Boolean combination.

While categorical treatments of flowchart languages are abundant, none of them provide a treatment of this dual nature of predicates. In the present paper, we argue that extensive restriction categories are precisely categories that capture such a condition/decision duality, by means of morphisms which, coincidentally, are also called decisions. Further, we show that having these categorical decisions amounts to having an internal logic: Analogous to how subobjects of an object in a topos form a Heyting algebra, we show that decisions on an object in an extensive restriction category form a De Morgan quasilattice, the algebraic structure associated with the (three-valued) weak Kleene logic K3w. Full classical propositional logic can be recovered by restricting to total decisions, yielding extensive categories in the usual sense, and confirming (from a different direction) a result from effectus theory that predicates on objects in extensive categories form Boolean algebras.

As an application, since (categorical) decisions are partial isomorphisms, this approach provides naturally reversible models of classical propositional logic and weak Kleene logic.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)
自引率
0.00%
发文量
0
期刊介绍: ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信