Graph Algebras and Derived Graph Operations

IF 0.4 Q4 LOGIC Journal of Applied Logics Pub Date : 2023-10-17 DOI:10.3390/logics1040010
Uwe Wolter, Tam Truong
{"title":"Graph Algebras and Derived Graph Operations","authors":"Uwe Wolter, Tam Truong","doi":"10.3390/logics1040010","DOIUrl":null,"url":null,"abstract":"We revise our former definition of graph operations and correspondingly adapt the construction of graph term algebras. As a first contribution to a prospective research field, Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. In particular, we generalize the concept of generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in-depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct, for any graph operation expression, a corresponding derived graph operation in any graph algebra.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"22 1","pages":"0"},"PeriodicalIF":0.4000,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Logics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/logics1040010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

We revise our former definition of graph operations and correspondingly adapt the construction of graph term algebras. As a first contribution to a prospective research field, Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. In particular, we generalize the concept of generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in-depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct, for any graph operation expression, a corresponding derived graph operation in any graph algebra.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
图代数和派生图运算
我们修正了以前图运算的定义,并相应地调整了图项代数的构造。作为对一个有前景的研究领域——通用图代数的第一个贡献,我们将代数的一些基本概念和结果推广到图代数。为了解决这一推广任务,我们通过更多的范畴论概念和结构来修正和重新表述通用代数中传统的集合论定义、构造和证明。特别地,我们推广了生成子代数的概念,并证明了图代数之间所有的单同态都是正则的。派生图操作是另一个主要主题。在深入分析了术语作为传统代数中派生操作的表示之后,我们确定了三种基本机制来从给定的操作中构建新的图操作:并行组合、实例化和顺序组合。作为项的对应物,我们引入了结构尽可能接近项结构的图运算表达式。我们证明了这三种机制允许我们对任何图运算表达式,在任何图代数中构造相应的派生图运算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Applied Logics
Journal of Applied Logics Mathematics-Logic
CiteScore
1.20
自引率
0.00%
发文量
0
期刊最新文献
Graph Algebras and Derived Graph Operations Carnap’s Problem for Intuitionistic Propositional Logic Bilateral Connexive Logic Why Logics? Logics for Epistemic Actions: Completeness, Decidability, Expressivity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1