Mathematical Structures in Computer Science最新文献_第6页

A linear logic framework for multimodal logics 多模态逻辑的线性逻辑框架

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-10-01 DOI: 10.1017/S0960129522000366

Bruno Xavier, C. Olarte, Elaine Pimentel

{"title":"A linear logic framework for multimodal logics","authors":"Bruno Xavier, C. Olarte, Elaine Pimentel","doi":"10.1017/S0960129522000366","DOIUrl":"https://doi.org/10.1017/S0960129522000366","url":null,"abstract":"Abstract One of the most fundamental properties of a proof system is analyticity, expressing the fact that a proof of a given formula F only uses subformulas of F. In sequent calculus, this property is usually proved by showing that the \u0000$mathsf{cut}$\u0000 rule is admissible, i.e., the introduction of the auxiliary lemma H in the reasoning “if H follows from G and F follows from H, then F follows from G” can be eliminated. The proof of cut admissibility is usually a tedious, error-prone process through several proof transformations, thus requiring the assistance of (semi-)automatic procedures. In a previous work by Miller and Pimentel, linear logic ( \u0000$mathsf{LL}$\u0000 ) was used as a logical framework for establishing sufficient conditions for cut admissibility of object logical systems (OL). The OL’s inference rules are specified as an \u0000$mathsf{LL}$\u0000 theory and an easy-to-verify criterion sufficed to establish the cut-admissibility theorem for the OL at hand. However, there are many logical systems that cannot be adequately encoded in \u0000$mathsf{LL}$\u0000 , the most symptomatic cases being sequent systems for modal logics. In this paper, we use a linear-nested sequent ( \u0000$mathsf{LNS}$\u0000 ) presentation of \u0000$mathsf{MMLL}$\u0000 (a variant of LL with subexponentials), and show that it is possible to establish a cut-admissibility criterion for \u0000$mathsf{LNS}$\u0000 systems for (classical or substructural) multimodal logics. We show that the same approach is suitable for handling the \u0000$mathsf{LNS}$\u0000 system for intuitionistic logic.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"32 1","pages":"1176 - 1204"},"PeriodicalIF":0.5,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41931400","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}

引用次数: 1

Weighted synchronous automata 加权同步自动机

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-10-01 DOI: 10.1017/S0960129522000421

Leandro Gomes, A. Madeira, L. Barbosa

引用次数: 0

Preface to Special Issue: LSFA 2019 and 2020 特刊前言：LSFA 2019和2020

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-10-01 DOI: 10.1017/S0960129523000075

A. Felty, Giselle Reis

引用次数: 0

A dual-context sequent calculus for the constructive modal logic S4 构造模态逻辑S4的对偶上下文序列演算

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-10-01 DOI: 10.1017/S0960129522000378

F. E. Miranda-Perea, Lourdes del Carmen González Huesca, Pilar Selene Linares Arévalo

{"title":"A dual-context sequent calculus for the constructive modal logic S4","authors":"F. E. Miranda-Perea, Lourdes del Carmen González Huesca, Pilar Selene Linares Arévalo","doi":"10.1017/S0960129522000378","DOIUrl":"https://doi.org/10.1017/S0960129522000378","url":null,"abstract":"Abstract The proof theory of the constructive modal logic S4 (hereafter \u0000$mathsf{CS4}$\u0000 ) has been settled since the beginning of this century by means of either standard natural deduction and sequent calculi or by the reconstruction of modal logic through hypothetical and categorical judgments à la Martin-Löf, an approach carried out by using a special kind of sequents, which keeps two separated contexts representing ordinary and enhanced hypotheses, intuitively interpreted as true and valid assumptions. These so-called dual-context sequents, originated in linear logic, are used to define a natural deduction system handling judgments of validity, truth, and possibility, resulting in a formalism equivalent to an axiomatic system for \u0000$mathsf{CS4}$\u0000 . However, this proof-theoretical study of \u0000$mathsf{CS4}$\u0000 lacks, to the best of our knowledge, its third fundamental constituent, namely a sequent calculus. In this paper, we define such a dual-context formalism, called \u0000${bf DG_{CS4}}$\u0000 , and provide detailed proofs of the admissibility for the ordinary cut rule as well as the elimination of a second cut rule, which manipulates enhanced hypotheses. Furthermore, we make available a formal verification of the equivalence of this proposal with the previously defined axiomatic and dual-context natural deduction systems for \u0000$mathsf{CS4}$\u0000 , using the Coq proof-assistant.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"32 1","pages":"1205 - 1233"},"PeriodicalIF":0.5,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45348018","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

Indexed and fibered structures for partial and total correctness assertions 用于部分和全部正确性断言的索引结构和纤维结构

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-09-19 DOI: 10.1017/S0960129522000275

Uwe Wolter, A. Martini, E. Haeusler

引用次数: 1

Detection and diagnosis of deviations in distributed systems of autonomous agents 分布式自治Agent系统中偏差的检测与诊断

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-09-06 DOI: 10.1017/S0960129522000251

Vivek Nigam, Minyoung Kim, Ian Mason, C. Talcott

引用次数: 0

On function spaces equipped with Isbell topology and Scott topology 基于Isbell拓扑和Scott拓扑的功能空间

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-09-01 DOI: 10.1017/S0960129523000014

Xiaoquan Xu, Meng Bao, Xiaoyuan Zhang

{"title":"On function spaces equipped with Isbell topology and Scott topology","authors":"Xiaoquan Xu, Meng Bao, Xiaoyuan Zhang","doi":"10.1017/S0960129523000014","DOIUrl":"https://doi.org/10.1017/S0960129523000014","url":null,"abstract":"Abstract In this paper, we mainly study the function spaces related to H-sober spaces. For an irreducible subset system H and \u0000$T_{0}$\u0000 spaces X and Y, it is proved that the following three conditions are equivalent: (1) the Scott space \u0000$Sigma mathcal O(X)$\u0000 of the lattice of all open sets of X is H-sober; (2) for every H-sober space Y, the function space \u0000$mathbb{C}(X, Y)$\u0000 of all continuous mappings from X to Y equipped with the Isbell topology is H-sober; (3) for every H-sober space Y, the Isbell topology on \u0000$mathbb{C}(X, Y)$\u0000 has property S with respect to H. One immediate corollary is that for a \u0000$T_{0}$\u0000 space X, Y is a d-space (resp., well-filtered space) iff the function space \u0000$mathbb{C}(X, Y)$\u0000 equipped with the Isbell topology is a d-space (resp., well-filtered space). It is shown that for any \u0000$T_0$\u0000 space X for which the Scott space \u0000$Sigma mathcal O(X)$\u0000 is non-sober, the function space \u0000$mathbb{C}(X, Sigma 2)$\u0000 equipped with the Isbell topology is not sober. The function spaces \u0000$mathbb{C}(X, Y)$\u0000 equipped with the Scott topology, the compact-open topology and the pointwise convergence topology are also discussed. Our study also leads to a number of questions, whose answers will deepen our understanding of the function spaces related to H-sober spaces.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"32 1","pages":"1099 - 1116"},"PeriodicalIF":0.5,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44228012","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}

引用次数: 1

Unmet Medical Needs and Early Referral of Pediatric Atopic Dermatitis: An Expert Modified Delphi Consensus from Saudi Arabia. 未满足的医疗需求与儿童特应性皮炎的早期转诊：沙特阿拉伯专家修改后的德尔菲共识。

IF 1.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-08-11 eCollection Date: 2022-01-01 DOI: 10.1155/2022/5636903

A Alradaddi, A Al Twaim, A Abu-Aliat, K Al-Atass, L Alogayell, M Aldayil, S AlBreiki, S Abed, M Fatani, O Alsharif, B Darwesh, Levent M Gunay, S Al-Khenaizan

{"title":"Unmet Medical Needs and Early Referral of Pediatric Atopic Dermatitis: An Expert Modified Delphi Consensus from Saudi Arabia.","authors":"A Alradaddi, A Al Twaim, A Abu-Aliat, K Al-Atass, L Alogayell, M Aldayil, S AlBreiki, S Abed, M Fatani, O Alsharif, B Darwesh, Levent M Gunay, S Al-Khenaizan","doi":"10.1155/2022/5636903","DOIUrl":"10.1155/2022/5636903","url":null,"abstract":"<p><p>Atopic dermatitis (AD) is a chronic skin disease with increasing prevalence worldwide. It is characterized by pruritic eczematous lesions, affecting up to 20% of the children and negatively impacting their quality of life. Guidelines for AD management are available worldwide, but specific guidelines for pediatric AD in Saudi Arabia are lacking. This consensus document aims to identify the needs for the diagnosis and management of pediatric AD in Saudi Arabia by gathering the opinions and recommendations of key experts. We conducted a three-step modified Delphi method to develop the present consensus. The experts agreed that pediatricians and dermatologists commonly encounter AD; however, it is still under-recognized in its early stage in Saudi Arabia. The family physicians should be involved in assessing suspected children with a family history of atopy, particularly in patients with isolated lesions. Further, the experts confirmed that AD diagnosis should be documented, showing assessment criteria used, key morphological characteristics, and features used to ascertain the severity of the disease. There is still a need for simple validated diagnostic criteria suitable for daily practice for pediatric AD. The experts highlighted several medical conditions that pertain to the diagnosis and management of AD in Saudi Arabia.</p>","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"7 1","pages":"5636903"},"PeriodicalIF":1.5,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11496595/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79266454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Introduction to the special issue: Confluence 特刊简介:合流

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-08-01 DOI: 10.1017/S0960129523000063

M. Ayala-Rincón, S. Mimram

引用次数: 0

Z property for the shuffling calculus 洗牌演算的Z性质

IF 0.5 4区计算机科学

Mathematical Structures in Computer Science Pub Date : 2022-08-01 DOI: 10.1017/S0960129522000408

K. Nakazawa, Ken-etsu Fujita, Yuta Imagawa

引用次数: 1