On the logic of -pregroups

DOI10.1007/S11225-007-9090-5MaRDI QIDQ2467221zbMATH OpenOpenAlexFDO

Authors Aleksandra Kiślak-Malinowska

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-9090-5

zbMATH Keywords

\(\beta\){-pregroup}cut-eliminationnormalization theorempregrouprewriting rulessequent system

Mathematics Subject Classification ID

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) Grammars and rewriting systems (68Q42)

Review text

The paper presents \(\beta\){-pregroups}, i.e., pregroups with modality operators, in the form of a rewriting system, and proves that in a given derivation the non-expanding rules must always preceed non-contracting ones for the derivation to be minimal (normalization theorem). It then presents a sequent system and proves the cut-elimination theorem. For illustration, the paper shows how to use \(\beta\){-pregroups} for linguistic applications. Section 1, Introduction, defines the notions of partially ordered monoid and (proper) pregroup, and gives a theorem with some equalities and inequalities; then it defines types and quasi-pregroups, and states the Lambek switching lemma [\textit{J. Lambek}, ``Type grammar revisited, Lect. Notes Comput. Sci. 1582, 1--27 (1999; Zbl 0934.03043)]. Section 2, Pregroups, with modalities, defines a pregroup with \(\beta\)-operator and a \(\beta\)-pregroup. It goes on to define rewriting rules that define the free \(\beta\)-pregroup generated by a poset \((P,\leq )\), and illustrates this with an example given by \textit{M. Fadda} [``Towards flexible pregroup grammars, in: New perspectives in logic and formal linguistics. Roma: Bulzoni Editore, 95--112 (2002)]. From there the author proceeds to prove the following theorem [Normalization theorem for \(\beta\){-pregroups}]: Every minimal derivation is normal. Section 3, Axiom system for pregroups with modalities, presents the rewriting system of Section 2 as a Gentzen-style calculus of sequents and proves cut elimination for systems with modalities.

Recommendations

• Type logics and pregroups
• Pregroup grammars and Chomsky's earliest examples
• scientific article; zbMATH DE number 1953885
• Extended pregroup grammars applied to natural languages
• Pregroup Calculus as a Logic Functor

Cites work

• Extending Lambek grammars to basic categorial grammars
• scientific article; zbMATH DE number 4002074 (Why is no real title available?)
• scientific article; zbMATH DE number 1341534 (Why is no real title available?)
• scientific article; zbMATH DE number 1786547 (Why is no real title available?)
• scientific article; zbMATH DE number 1786548 (Why is no real title available?)
• scientific article; zbMATH DE number 2111978 (Why is no real title available?)
• scientific article; zbMATH DE number 3222127 (Why is no real title available?)
• Sequent systems for compact bilinear logic
• The Mathematics of Sentence Structure
• Type grammars as pregroups

Cited in

(3)

• Type logics and pregroups
• Pregroup Calculus as a Logic Functor
• A computational algebraic analysis of Hindi syntax

This page was built for publication: On the logic of \(\beta\)-pregroups

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