Theoretical Computer Science
Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
Journal of Symbolic Logic
Handbook of Logic and Language
Handbook of Logic and Language
Underspecification in Type-Logical Grammars
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Lambek Grammars Based on Pregroups
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
An Algebraic Approach to French Sentence Structure
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
An Algebraic Analysis of Clitic Pronouns in Italian
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Pregroups: Models and Grammars
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Optional and Iterated Types for Pregroup Grammars
Language and Automata Theory and Applications
Nonassociative Lambek Calculus with Additives and Context-Free Languages
Languages: From Formal to Natural
Fully lexicalized pregroup grammars
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Mildly context-sensitive languages via buffer augmented pregroup grammars
Time for verification
A savateev-style parsing algorithm for pregroup grammars
FG'09 Proceedings of the 14th international conference on Formal grammar
Clitic movement in pregroup grammar: a cross-linguistic approach
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Semantic Vector Models and Functional Models for Pregroup Grammars
Journal of Logic, Language and Information
On categorial grammars as logical information systems
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Category theoretical semantics for pregroup grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Pregroup grammars with letter promotions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Agreement and cliticization in italian: a pregroup analysis
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Fundamenta Informaticae
Pregroup grammars with letter promotions: Complexity and context-freeness
Journal of Computer and System Sciences
Studia Logica
Displacement logic for anaphora
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A protogroup is an ordered monoid in which each element a has both a left proto-inverse al such that ala ≤ 1 and a right protoinverse ar such that aar ≤ 1. We explore the assignment of elements of a free protogroup to English words as an aid for checking which strings of words are well-formed sentences, though ultimately we may have to relax the requirement of freeness. By a pregroup we mean a protogroup which also satisfies 1 ≤ aal and 1 ≤ ara, rendering al a left adjoint and ar a right adjoint of a. A pregroup is precisely a poset model of classical noncommutative linear logic in which the tensor product coincides with it dual. This last condition is crucial to our treatment of passives and Wh-questions, which exploits the fact that all ≠ a in general. Free pregroups may be used to recognize the same sentences as free protogroups.