De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic

Author:

Horne Ross1ORCID,Tiu Alwen2,Aman Bogdan3,Ciobanu Gabriel3

Affiliation:

1. Computer Science and Communications, University of Luxembourg, Esch-sur-Alzette, Luxembourg

2. Research School of Computer Science, The Australian National University, Canberra, Australia

3. Alexandru Ioan Cuza University of Iaşi, Iaşi, Romania

Abstract

This article explores the proof theory necessary for recommending an expressive but decidable first-order system, named MAV1, featuring a De Morgan dual pair of nominal quantifiers. These nominal quantifiers called “new” and “wen” are distinct from the self-dual Gabbay-Pitts and Miller-Tiu nominal quantifiers. The novelty of these nominal quantifiers is they are polarised in the sense that “new” distributes over positive operators while “wen” distributes over negative operators. This greater control of bookkeeping enables private names to be modelled in processes embedded as formulae in MAV1. The technical challenge is to establish a cut elimination result from which essential properties including the transitivity of implication follow. Since the system is defined using the calculus of structures, a generalisation of the sequent calculus, novel techniques are employed. The proof relies on an intricately designed multiset-based measure of the size of a proof, which is used to guide a normalisation technique called splitting . The presence of equivariance, which swaps successive quantifiers, induces complex inter-dependencies between nominal quantifiers, additive conjunction, and multiplicative operators in the proof of splitting. Every rule is justified by an example demonstrating why the rule is necessary for soundly embedding processes and ensuring that cut elimination holds.

Funder

Ministry of Education, Singapore, Tier 2

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A System of Interaction and Structure III: The Complexity of BV and Pomset Logic;Logical Methods in Computer Science;2023-12-18

2. An Analytic Propositional Proof System on Graphs;Logical Methods in Computer Science;2022-10-21

3. A Deep Inference System for Differential Linear Logic;Electronic Proceedings in Theoretical Computer Science;2021-12-30

4. Finitely Supported Binary Relations between Infinite Atomic Sets;Symmetry;2021-10-27

5. Logic Beyond Formulas;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3