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.
Original language | English |
---|---|
Article number | 4 |
Pages (from-to) | 1-44 |
Number of pages | 44 |
Journal | ACM Transactions on Computational Logic |
Volume | 20 |
Issue number | 4 |
DOIs | |
Publication status | Published - 16 Jul 2019 |
Funding
R. Horne and A. Tiu acknowledge support from Ministry of Education, Singapore, Tier 2 grant MOE2014-T2-2-076. Authors’ addresses: R. Horne, Faculty of Science, Technology and Communication, 6 avenue de la Fonte, L-4364 Esch-sur-Alzette, Luxembourg; email: [email protected]; A. Tiu, Research School of Computer Science, The Australian National University, Building 108, North Road, Canberra, ACT 2061, Australia; email: [email protected]; B. Aman and G. Ciobanu, Alexandru Ioan Cuza University of Iaşi, Bulevardul Carol I, Nr.11, 700506, Iaşi, România; emails: bogdan.aman@iit. academiaromana-is.ro, [email protected]. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM. 1529-3785/2019/07-ART22 $15.00 https://doi.org/10.1145/3325821
Keywords
- calculus of structures
- nominal logic
- non-commutative logic
- theory of computation
- models of computation