اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSubexponentials in non-commutative linear logic
157
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Linear logical frameworks with subexponentials have been used for the specification of among other systems, proof systems, concurrent programming languages and linear authorization logics. In these frameworks, subexponentials can be configured to allow or not for the application of the contraction and weakening rules while the exchange rule can always be applied. This means that formulae in such frameworks can only be organized as sets and multisets of formulae not being possible to organize formulae as lists of formulae. This paper investigates the proof theory of linear logic proof systems in the non-commutative variant. These systems can disallow the application of exchange rule on some subexponentials. We investigate conditions for when cut-elimination is admissible in the presence of non-commutative subexponentials, investigating the interaction of the exchange rule with local and non-local contraction rules. We also obtain some new undecidability and decidability results on non-commutative linear logic with subexponentials.
قيم البحث
اقرأ أيضاً
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. Short-circuit evaluation is widely used in pro
gramming, with sequential conjunction and disjunction as primitive connectives. We study the question which logical laws axiomatize short-circuit evaluation under the following assumptions: compound statements are evaluated from left to right, each atom (propositional variable) evaluates to either true or false, and atomic evaluations can cause a side effect. The answer to this question depends on the kind of atomic side effects that can occur and leads to different short-circuit logics. The basic case is FSCL (free short-circuit logic), which characterizes the setting in which each atomic evaluation can cause a side effect. We recall some main results and then relate FSCL to MSCL (memorizing short-circuit logic), where in the evaluation of a compound statement, the first evaluation result of each atom is memorized. MSCL can be seen as a sequential variant of propositional logic: atomic evaluations cannot cause a side effect and the sequential connectives are not commutative. Then we relate MSCL to SSCL (static short-circuit logic), the variant of propositional logic that prescribes short-circuit evaluation with commutative sequential connectives. We present evaluation trees as an intuitive semantics for short-circuit evaluation, and simple equational axiomatizations for the short-circuit logics mentioned that use negation and the sequential connectives only.
Danos and Regnier (1989) introduced the par-switching condition for the multiplicative proof-structures and simplified the sequentialization theorem of Girard (1987) by the use of par-switching. Danos and Regner (1989) also generalized the par-switch
ing to a switching for $n$-ary connectives (an $n$-ary switching, in short) and showed that the expansion property which means that any excluded-middle formula has a correct proof-net in the sense of their $n$-ary switching. They added a remark that the sequentialization theorem does not hold with their switching. Their definition of switching for $n$-ary connectives is a natural generalization of the original switching for the binary connectives. However, there are many other possible definitions of switching for $n$-ary connectives. We give an alternative and natural definition of $n$-ary switching, and we remark that the proof of sequentialization theorem by Olivier Laurent with the par-switching works for our $n$-ary switching; hence that the sequentialization theorem holds for our $n$-ary switching. On the other hand, we remark that the expansion property does not hold with our switching anymore. We point out that no definition of $n$-ary switching satisfies both the sequentialization theorem and the expansion property at the same time except for the purely tensor-based (or purely par-based) connectives.
This paper 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 s
elf-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.
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. It turned out that full propositional Linear Logic is undecidable (Lincoln, Mitchell, Scedrov, and Shankar) and, hence, it is more expressive than (modalized
) classical or intuitionistic logic. In this paper we focus on the study of the simplest fragments of Linear Logic, such as the one-literal and constant-only fragments (the latter contains no literals at all). Here we demonstrate that all these extremely simple fragments of Linear Logic (one-literal, $bot$-only, and even unit-only) are exactly of the same expressive power as the corresponding fu
We show that it is in principle possible to construct dualities between commutative and non-commutative theories in a systematic way. This construction exploits a generalization of the exact renormalization group equation (ERG). We apply this to the
simple case of the Landau problem and then generalize it to the free and interacting non-canonical scalar field theory. This constructive approach offers the advantage of tracking the implementation of the Lorentz symmetry in the non-commutative dual theory. In principle, it allows for the construction of completely consistent non-commutative and non-local theories where the Lorentz symmetry and unitarity are still respected, but may be implemented in a highly non-trivial and non-local manner.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
