Extending free pregroups with lower bounds

DOI10.1007/S11225-010-9264-4zbMath1228.03013OpenAlexW2004877903MaRDI QIDQ993496

Tamar Aizikowitz, Michael Kaminski, Daniel Genkin, Nissim Francez

Publication date: 20 September 2010

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-010-9264-4

zbMATH Keywords

natural languagepregroup grammarsformal language theorytype-logical grammars

Mathematics Subject Classification ID

Logic of natural languages (03B65) Algebraic theory of languages and automata (68Q70) Other algebras related to logic (03G25) Grammars and rewriting systems (68Q42) Natural language processing (68T50) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Ordered structures (06F99)

Related Items (1)

Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars

Cites Work

• Commutation-augmented pregroup grammars and mildly context-sensitive languages
• EQUATIONS IN A FREE GROUP
• DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
• Complexity of Makanin's algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending free pregroups with lower bounds