Mathematical Structures in Computer Science最新文献

筛选
英文 中文
On Hofmann–Streicher universes 关于霍夫曼-斯特赖歇尔宇宙
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-09-19 DOI: 10.1017/s0960129524000203
Steve Awodey
{"title":"On Hofmann–Streicher universes","authors":"Steve Awodey","doi":"10.1017/s0960129524000203","DOIUrl":"https://doi.org/10.1017/s0960129524000203","url":null,"abstract":"We take another look at the construction by Hofmann and Streicher of a universe <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000203_inline1.png\"/> <jats:tex-math> $(U,{mathcal{E}l})$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> for the interpretation of Martin-Löf type theory in a presheaf category <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000203_inline2.png\"/> <jats:tex-math> $[{{{mathbb{C}}}^{textrm{op}}},textsf{Set}]$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. It turns out that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000203_inline3.png\"/> <jats:tex-math> $(U,{mathcal{E}l})$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> can be described as the <jats:italic>nerve</jats:italic> of the classifier <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000203_inline4.png\"/> <jats:tex-math> $dot{{textsf{Set}}}^{textsf{op}} rightarrow{{textsf{Set}}}^{textsf{op}}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> for discrete fibrations in <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000203_inline5.png\"/> <jats:tex-math> $textsf{Cat}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>, where the nerve functor is right adjoint to the so-called “Grothendieck construction” taking a presheaf <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000203_inline6.png\"/> <jats:tex-math> $P :{{{mathbb{C}}}^{textrm{op}}}rightarrow{textsf{Set}}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> to its category of elements <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000203_inline7.png\"/> <jats:tex-math> $int _{mathbb{C}} P$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. We also consider change of base for such universes, as well as universes of structured families, such as fibrations.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142259193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
T0-spaces and the lower topology T0 空间和下拓扑
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-09-19 DOI: 10.1017/s0960129524000240
Jimmie Lawson, Xiaoquan Xu
{"title":"T0-spaces and the lower topology","authors":"Jimmie Lawson, Xiaoquan Xu","doi":"10.1017/s0960129524000240","DOIUrl":"https://doi.org/10.1017/s0960129524000240","url":null,"abstract":"The authors’ primary goal in this paper is to enhance the study of &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000240_inline1.png\"/&gt; &lt;jats:tex-math&gt; $T_0$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; topological spaces by using the order of specialization of a &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000240_inline2.png\"/&gt; &lt;jats:tex-math&gt; $T_0$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;-space to introduce the lower topology (with a subbasis of closed sets &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000240_inline3.png\"/&gt; &lt;jats:tex-math&gt; $mathord{uparrow } x$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;) and studying the interaction of the original topology and the lower topology. Using the lower topology, one can define and study new properties of the original space that provide deeper insight into its structure. One focus of study is the property R, which asserts that if the intersection of a family of finitely generated sets &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000240_inline4.png\"/&gt; &lt;jats:tex-math&gt; $mathord{uparrow } F$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;, &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000240_inline5.png\"/&gt; &lt;jats:tex-math&gt; $F$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; finite, is contained in an open set &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000240_inline6.png\"/&gt; &lt;jats:tex-math&gt; $U$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;, then the same is true for finitely many of the family. We first show that property R is equivalent to several other interesting properties, for example, the property that all closed subsets of the original space are compact in the lower topology. We then find conditions under which these spaces are compact, well-filtered, and coherent, a weaker variant of stably compact spaces. We also investigate what have been called strong &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000240_inline7.png\"/&gt; &lt;jats:tex-math&gt; $d$ &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;-spaces, develop some of their basic properties, and make connections with the earlier considerations involving spaces satisfying property R. Two key results we obtain are that if a dcpo &lt;jats:inline-formula","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142259194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GADTs are not (Even partial) functors GADT 不是(甚至不是部分)函数
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-08-27 DOI: 10.1017/s0960129524000161
Pierre Cagne, Enrico Ghiorzi, Patricia Johann
{"title":"GADTs are not (Even partial) functors","authors":"Pierre Cagne, Enrico Ghiorzi, Patricia Johann","doi":"10.1017/s0960129524000161","DOIUrl":"https://doi.org/10.1017/s0960129524000161","url":null,"abstract":"<jats:italic>Generalized Algebraic Data Types</jats:italic> (GADTs) are a syntactic generalization of the usual algebraic data types (ADTs), such as lists, trees, etc. ADTs’ standard initial algebra semantics (IAS) in the category <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000161_inline1.png\"/> <jats:tex-math> $mathit{Set}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> of sets justify critical syntactic constructs – such as recursion, pattern matching, and fold – for programming with them. In this paper, we show that semantics for GADTs that specialize to the IAS for ADTs are necessarily unsatisfactory. First, we show that the functorial nature of such semantics for GADTs in <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000161_inline2.png\"/> <jats:tex-math> $mathit{Set}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> introduces <jats:italic>ghost</jats:italic> elements, i.e., elements not writable in syntax. Next, we show how such ghost elements break parametricity. We observe that the situation for GADTs contrasts dramatically with that for ADTs, whose IAS coincides with the parametric model constructed via their Church encodings in System F. Our analysis reveals that the fundamental obstacle to giving a functorial IAS for GADTs is the inherently partial nature of their map functions. We show that this obstacle cannot be overcome by replacing <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000161_inline3.png\"/> <jats:tex-math> $mathit{Set}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> with other categories that account for this partiality.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142176661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A linear linear lambda-calculus 线性λ演算法
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-05-31 DOI: 10.1017/s0960129524000197
Alejandro Díaz-Caro, Gilles Dowek
{"title":"A linear linear lambda-calculus","authors":"Alejandro Díaz-Caro, Gilles Dowek","doi":"10.1017/s0960129524000197","DOIUrl":"https://doi.org/10.1017/s0960129524000197","url":null,"abstract":"We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part of a broader research program aiming to define a logic with a proof language that forms a quantum programming language.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Countability constraints in order-theoretic approaches to computability 可计算性秩序论方法中的可数性约束
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-05-30 DOI: 10.1017/s0960129524000173
Pedro Hack, Daniel A. Braun, Sebastian Gottwald
{"title":"Countability constraints in order-theoretic approaches to computability","authors":"Pedro Hack, Daniel A. Braun, Sebastian Gottwald","doi":"10.1017/s0960129524000173","DOIUrl":"https://doi.org/10.1017/s0960129524000173","url":null,"abstract":"Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate such notions from Turing machines to uncountable spaces. Since these machines are used as a baseline for computability in these approaches, countability restrictions on the ordered structures are fundamental. Here, we show several relations between the usual countability restrictions in order-theoretic theories of computability and some more common order-theoretic countability constraints, like order density properties and functional characterizations of the order structure in terms of multi-utilities. As a result, we show how computability can be introduced in some order structures via countability order density and multi-utility constraints.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Logical characterizations of algebraic circuit classes over integral domains 积分域上代数电路类的逻辑特征
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-05-13 DOI: 10.1017/s0960129524000136
Timon Barlag, Florian Chudigiewitsch, Sabrina A. Gaube
{"title":"Logical characterizations of algebraic circuit classes over integral domains","authors":"Timon Barlag, Florian Chudigiewitsch, Sabrina A. Gaube","doi":"10.1017/s0960129524000136","DOIUrl":"https://doi.org/10.1017/s0960129524000136","url":null,"abstract":"We present an adapted construction of algebraic circuits over the reals introduced by Cucker and Meer to arbitrary infinite integral domains and generalize the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000136_inline1.png\"/> <jats:tex-math> $mathrm{AC}_{mathbb{R}}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000136_inline2.png\"/> <jats:tex-math> $mathrm{NC}_{mathbb{R}}^{}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> classes for this setting. We give a theorem in the style of Immerman’s theorem which shows that for these adapted formalisms, sets decided by circuits of constant depth and polynomial size are the same as sets definable by a suitable adaptation of first-order logic. Additionally, we discuss a generalization of the guarded predicative logic by Durand, Haak and Vollmer, and we show characterizations for the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000136_inline3.png\"/> <jats:tex-math> $mathrm{AC}_{R}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000136_inline4.png\"/> <jats:tex-math> $mathrm{NC}_R^{}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> hierarchy. Those generalizations apply to the Boolean <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000136_inline5.png\"/> <jats:tex-math> $mathrm{AC}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000136_inline6.png\"/> <jats:tex-math> $mathrm{NC}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> hierarchies as well. Furthermore, we introduce a formalism to be able to compare some of the aforementioned complexity classes with different underlying integral domains.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140931685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On planarity of graphs in homotopy type theory 论同调类型理论中图形的平面性
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-05-08 DOI: 10.1017/s0960129524000100
Jonathan Prieto-Cubides, Håkon Robbestad Gylterud
{"title":"On planarity of graphs in homotopy type theory","authors":"Jonathan Prieto-Cubides, Håkon Robbestad Gylterud","doi":"10.1017/s0960129524000100","DOIUrl":"https://doi.org/10.1017/s0960129524000100","url":null,"abstract":"In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces and maps of graphs embedded in the sphere, in homotopy type theory (HoTT). This allows us to provide an elementary characterisation of planarity for locally directed finite and connected multigraphs that takes inspiration from topological graph theory, particularly from combinatorial embeddings of graphs into surfaces. A graph is planar if it has a map and an outer face with which any walk in the embedded graph is walk-homotopic to another. A result is that this type of planar maps forms a homotopy set for a graph. As a way to construct examples of planar graphs inductively, extensions of planar maps are introduced. We formalise the essential parts of this work in the proof assistant Agda with support for HoTT.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140932043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Special Issue on Theory and Applications of Models of Computation TAMC 2022 计算模型的理论与应用特刊 TAMC 2022
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-05-07 DOI: 10.1017/s096012952400015x
Dingzhu Du, Chenchen Wu, Ruiqi Yang
{"title":"Special Issue on Theory and Applications of Models of Computation TAMC 2022","authors":"Dingzhu Du, Chenchen Wu, Ruiqi Yang","doi":"10.1017/s096012952400015x","DOIUrl":"https://doi.org/10.1017/s096012952400015x","url":null,"abstract":"","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141005505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
You can only be lucky once: optimal gossip for epistemic goals 你只能幸运一次:认识论目标的最佳流言
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-04-19 DOI: 10.1017/s0960129524000082
Hans van Ditmarsch, Malvin Gattinger
{"title":"You can only be lucky once: optimal gossip for epistemic goals","authors":"Hans van Ditmarsch, Malvin Gattinger","doi":"10.1017/s0960129524000082","DOIUrl":"https://doi.org/10.1017/s0960129524000082","url":null,"abstract":"It is known that without synchronization via a global clock one cannot obtain common knowledge by communication. Moreover, it is folklore that without communicating higher-level information one cannot obtain arbitrary higher-order shared knowledge. Here, we make this result precise in the setting of gossip where agents make one-to-one telephone calls to share secrets: we prove that “everyone knows that everyone knows that everyone knows all secrets” is unsatisfiable in a logic of knowledge for gossiping. We also prove that, given <jats:italic>n</jats:italic> agents, <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000082_inline1.png\" /> <jats:tex-math> $2n-3$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> calls are optimal to reach “someone knows that everyone knows all secrets” and that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000082_inline2.png\" /> <jats:tex-math> $n - 2 + binom{n}{2}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> calls are optimal to reach “everyone knows that everyone knows all secrets.”","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140625889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Abstract cyclic proofs 抽象循环证明
IF 0.5 4区 计算机科学
Mathematical Structures in Computer Science Pub Date : 2024-04-19 DOI: 10.1017/s0960129524000070
Bahareh Afshari, Dominik Wehr
{"title":"Abstract cyclic proofs","authors":"Bahareh Afshari, Dominik Wehr","doi":"10.1017/s0960129524000070","DOIUrl":"https://doi.org/10.1017/s0960129524000070","url":null,"abstract":"Cyclic proof systems permit derivations that are finite graphs in contrast to conventional derivation trees. The soundness of such proofs is ensured by imposing a soundness condition on derivations. The most common such condition is the <jats:italic>global trace condition</jats:italic> (GTC), a condition on the infinite paths through the derivation graph. To give a uniform treatment of such cyclic proof systems, Brotherston proposed an abstract notion of trace. We extend Brotherston’s approach into a category theoretical rendition of cyclic derivations, advancing the framework in two ways: first, we introduce <jats:italic>activation algebras</jats:italic> which allow for a more natural formalisation of trace conditions in extant cyclic proof systems. Second, accounting for the composition of trace information allows us to derive novel results about cyclic proofs, such as introducing a Ramsey-style trace condition. Furthermore, we connect our notion of trace to automata theory and prove that verifying the GTC for abstract cyclic proofs with certain trace conditions is PSPACE-complete.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140625588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信