Corpus ID: 236087488

Cobordisms and commutative categorial grammars

  title={Cobordisms and commutative categorial grammars},
  author={Sergey Slavnov},
We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms for short, which are certain bipartite graphs decorated with words in a given alphabet, generalizing linear logic proof-nets. We also introduce and study linear logic grammars, directly based on cobordisms and using classical multiplicative linear logic as a typing system. 
On embedding Lambek calculus into commutative categorial grammars
The problem of encoding noncommutative operations in ACG turns out possible after enriching the system with new unary operators, and the resulting system allows representing both ACG and Lambek grammars as conservative fragments, while the formalism remains, as it seems to us, rather simple and intuitive. Expand


Towards Abstract Categorial Grammars
A new categorial formalism based on intuitionistic linear logic, which derives from current type-logical grammars, is abstract in the sense that both syntax and semantics are handled by the same set of primitives. Expand
The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars
It is shown that the universal membership problem for the class of lexicalized ACGs is NP-complete and the languages generated by lexicalization ACGs form a subclass of NP which includes some NP- complete languages. Expand
Separating Syntax and Combinatorics in Categorial Grammar
This paper argues that modern versions of categorial grammar and in particular multimodal categorial grammar can profit considerably from reintroducing Haskell Curry’s old distinction between what heExpand
11 Encoding second order string ACG with deterministic tree walking transducers
In this paper we study the class of string languages represen ted by second order Abstract Categorial Grammar. We prove that this class is the sa me as the class of output languages of determisticExpand
Linear Logic, -Autonomous Categories and Cofree Coalgebras
A brief outline of the categorical characterisation of Girard's linear logic is given, analagous to the relationship between cartesian closed categories and typed-calculus. The linear structureExpand
Linear Lambda-Calculus and Categorial Models Revisited
In this paper, multiplicative exponential linear logic (MELL) is considered, i.e. the fragment which has multiplicative conjunction or tensor, , linear implication,, and the logical operator, `!', which allows a formula to be used as many times as required (including zero). Expand
Type Grammar Revisited
  • J. Lambek
  • Mathematics, Computer Science
  • LACL
  • 1997
This work explores 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 the requirement of freeness may have to relax. Expand
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
It is explained how structures which have arisen in recent work by the present author and Bob Coecke support a notion of scalar which allows quantitative aspects of physical theory to be expressed, and how the notion of strong compact closure emerges as a significant refinement of the more classical notion of compact closed category. Expand
Distinguishing Phenogrammar from Tectogrammar Simplifies the Analysis of Interrogatives
A variant of this architecture in which word order is represented using the terms of a typed λ-calculus and the syntactic type system is based on linear logic is used to analyze interrogatives in English and Chinese. Expand
The Mathematics of Sentence Structure
The aim of this paper is to obtain an effective rule (or algorithm) for distinguishing sentences from nonsentences, which works not only for the formal languages of interest to the mathematicalExpand