A note on undecidability of propositional non-associative linear logics

09/30/2019
by   Hiromi Tanaka, et al.
0

We introduce a non-associative and non-commutative version of propositional intuitionistic linear logic, called propositional non-associative non-commutative intuitionistic linear logic (NACILL for short). We prove that NACILL and any of its extensions by the rules of exchange and/or contraction are undecidable. Furthermore, we introduce two types of classical versions of NACILL, i.e., an involutive version of NACILL and a cyclic and involutive version of NACILL. We show that both of these logics are also undecidable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2020

Decision Problems for Propositional Non-associative Linear Logic and Extensions

In our previous work, we proposed the logic obtained from full non-assoc...
research
03/17/2023

On decidable extensions of Propositional Dynamic Logic with Converse

We describe a family of decidable propositional dynamic logics, where at...
research
02/10/2011

Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version)

This paper relates the well-known Linear Temporal Logic with the logic o...
research
02/03/2018

Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach

We add to intuitionistic logic infinitely many classical disjunctive tau...
research
01/07/2022

TOWER-Complete Problems in Contraction-Free Substructural Logics

We investigate the computational complexity of a family of substructural...
research
02/02/2023

Propositional Logics for the Lawvere Quantale

Lawvere showed that generalised metric spaces are categories enriched ov...
research
01/24/2010

A Decidable Class of Nested Iterated Schemata (extended version)

Many problems can be specified by patterns of propositional formulae dep...

Please sign up or login with your details

Forgot password? Click here to reset