On the logic of -pregroups

DOI10.1007/S11225-007-9090-5zbMATH Open1138.03021OpenAlexW1971551322MaRDI QIDQ2467221FDOQ2467221

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

cut-eliminationpregroupsequent systemrewriting rulesnormalization theorem\(\beta\){-pregroup}

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)

Cites Work

• The Mathematics of Sentence Structure
• Type grammars as pregroups
• Sequent systems for compact bilinear logic
• Extending Lambek grammars to basic categorial grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• A computational algebraic analysis of Hindi syntax
• Type logics and pregroups

   Recommendations

• Type logics and pregroups 👍 👎
• Pregroup grammars and Chomsky's earliest examples 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Pregroup Calculus as a Logic Functor 👍 👎

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)