Cyclic logic extends full nonassociative lambek calculus with constants

Cyclic Nonassociative Bilinear Logic With Additive Constants as Extension of Full Nonassociative Lambek Calculus

Logic in Computer Science

Summary

The authors investigate a type of logic called Cyclic Nonassociative Bilinear Logic (CyNBL), which sits between two known forms of linear logic. They show that CyNBL can expand on Full Nonassociative Lambek Calculus (FL) by adding certain constants without changing FL’s original proofs, even when extra assumptions are added. This finding clarifies how these logical systems relate and ensures that adding constants keeps things consistent. It helps understand how combining these logics preserves essential properties.

What this means in practice

  • For logic system designers: Confirm that adding constants to cyclic bilinear logic preserves properties relying on nonassociative Lambek calculus under various axioms.
  • For formal verification engineers: Use the extended cyclic logic framework for reasoning about systems where associativity and commutativity do not hold but constants are involved.

A theory result. No direct application yet.

Authors

Paweł Płaczek, Cheng-Syuan Wan

Abstract

Cyclic Linear Logic (CyMALL, CyBL) is a compromise between Commutative Linear Logic (MALL) and Noncommutative Linear Logic (Bilinear Logic, BL). We do not admit commutativity of the tensor, but we still admit only one De Morgan negation. MALL and its variants are natural extensions of Full Lambek Calculus (FL). Abrusci proved that CyBL is not a conservative extension of FL, if we admit additive constants in these logics. In this paper we show that Cyclic Nonassociative Bilinear Logic (CyNBL) with both additive constants is a strongly conservative extension of Full Nonassociative Lambek Calculus with only one additive constant - the upper bound - and that this holds even in the presence of an arbitrary set of nonlogical axioms.