English

Residuated Basic Logic I

Logic 2014-03-14 v1 Logic in Computer Science

Abstract

We study the residuated basic logic (RBL\mathsf{RBL}) of residuated basic algebra in which the basic implication of Visser's basic propositional logic (BPL\mathsf{BPL}) is interpreted as the right residual of a non-associative binary operator \cdot (product). We develop an algebraic system SRBL\mathsf{S_{RBL}} of residuated basic algebra by which we show that RBL\mathsf{RBL} is a conservative extension of BPL\mathsf{BPL}. We present the sequent formalization LRBL\mathsf{L_{RBL}} of SRBL\mathsf{S_{RBL}} which is an extension of distributive full non-associative Lambek calculus (DFNL\mathsf{DFNL}), and show that the cut elimination and subformula property hold for it.

Keywords

Cite

@article{arxiv.1403.3354,
  title  = {Residuated Basic Logic I},
  author = {Minghui Ma and Zhe Lin},
  journal= {arXiv preprint arXiv:1403.3354},
  year   = {2014}
}

Comments

18 pages with 1 figure

R2 v1 2026-06-22T03:26:18.190Z