Type logics and pregroups

DOI10.1007/S11225-007-9083-4MaRDI QIDQ2467212zbMATH OpenOpenAlexFDO

Publication date 21 January 2008

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11225-007-9083-4

bilinear algebra categorial grammar Lambek calculus pregroup substructural logics type logic

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Cut-elimination and normal-form theorems (03F05)

Review text

The author first outlines several type logics related to the Lambek calculus L as well as their semantical frameworks by linguistic and algebraic means, among them the logic of pregroups, or Compact Bilinear Logic CBL, which is the primary subject of the paper. The main issue is a formalization of an extended sequent system of CBL enjoying the cut-elimination theorem and the normalization theorem (corresponding to the Lambek switching lemma for CBL), with which are obtained the P-TIME decidability (for CBL and the extension) and a faithful interpretation of CBL in L1 (L with the unitary constant 1). The author also surveys the results on pregroups he has established so far, and provides a general construction of (preordered) bilinear algebras and pregroups whose universe is an arbitrary monoid.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Type logics and pregroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467212)