Results 1  10
of
13
Noncommutative logic I : the multiplicative fragment
, 1998
"... INTRODUCTION Unrestricted exchange rules of Girard's linear logic [8] force the commutativity of the multiplicative connectives\Omega (times, conjunction) and & (par, disjunction) , and henceforth the commutativity of all logic. This a priori commutativity is not always desirable  it is quite pro ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
INTRODUCTION Unrestricted exchange rules of Girard's linear logic [8] force the commutativity of the multiplicative connectives\Omega (times, conjunction) and & (par, disjunction) , and henceforth the commutativity of all logic. This a priori commutativity is not always desirable  it is quite problematic in applications like linguistics or computer science , and actually the desire of a noncommutative logic goes back to the very beginning of LL [9]. Previous works on noncommutativity deal essentially with noncommutative fragments of LL, obtained by removing the exchange rule at all. At that point, a simple remark on the status of exchange in the sequent calculus is necessary to be clear: there are two presentations of exchange in commutative LL, either sequents are finite sets of occurrences of formulas and exchange is obviously implicit, or sequents are fini
Lambek calculus is npcomplete
 Theoretical Computer Science
, 2003
"... We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L ∗ the derivability problem is NPcomplete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NPcomplete. ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L ∗ the derivability problem is NPcomplete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NPcomplete.
Types as graphs: Continuations in type logical grammar
, 2005
"... Using the programminglanguage concept of CONTINUATIONS, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of insitu quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as c ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Using the programminglanguage concept of CONTINUATIONS, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of insitu quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, typelogical way to model evaluation order and side effects in natural language. We illustrate with an improved account of quantificational binding, weak crossover, whquestions, superiority, and polarity licensing.
Model Theoretic Syntax
 The Glot International State of the Article Book 1, Studies in Generative Grammar 48, Mouton de Gruyter
, 1998
"... this article appeared in Glot, the main issue agitating researchers in model theoretic syntax was the problem of the contextfree barrier. We have seen that the hierarchy of logics collapses, when applied to trees, at the border of the tree languages strongly generated by context free (string) gramm ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
this article appeared in Glot, the main issue agitating researchers in model theoretic syntax was the problem of the contextfree barrier. We have seen that the hierarchy of logics collapses, when applied to trees, at the border of the tree languages strongly generated by context free (string) grammars, in the sense that distinctions between the different tree logics reduce to apparently superficial distinctions in how much memory allocation is hidden in the logic. The problem which researchers set themselves was not just breaking the context free barrier but remaining decidable in the process. This is a very difficult problem, and it must be admitted right off that it is somewhat artificial in that there is no a priori reason to suppose that natural languages can be described in a decidable logic. The arguments on either side are something like the following. First, the rather slight increases in computational complexity required to get the "mildly context sensitive" languages do suggest that this might be possible. The hunch here would be that the qualities that characterize the mildly context sensitive languages (polynomial parsability, constant growth property) as being like the contextfree languages are going to turn out to be reflections of decidability. The problems must not be underestimated, however! It is well known that the monadic second order logic of trees is one of the most powerful decidable logics known. It seems unlikely that any primitive relations can be added to the repertoire of tree description primitives that we have already seen, without making the logic undecidable. Many attempts have been made within logic and all have failed. So it is equally tempting to conjecture that the contextfree boundary coincides in some deep sense with the bounda...
A Substructural Type System for Delimited Continuations
"... We propose type systems that abstractly interpret smallstep rather than bigstep operational semantics. We treat an expression or evaluation context as a structure in a linear logic with hypothetical reasoning. Evaluation order is not only regulated by familiar focusing rules in the operational sem ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We propose type systems that abstractly interpret smallstep rather than bigstep operational semantics. We treat an expression or evaluation context as a structure in a linear logic with hypothetical reasoning. Evaluation order is not only regulated by familiar focusing rules in the operational semantics, but also expressed by structural rules in the type system, so the types track control flow more closely. Binding and evaluation contexts are related, but the latter are linear. We use these ideas to build a type system for delimited continuations. It lets control operators change the answer type or act beyond the nearest dynamicallyenclosing delimiter, yet needs no extra fields in judgments and arrow types to record answer types. The typing derivation of a directstyle program desugars it into continuationpassing style.
On generalized Ajdukiewicz and Lambek calculi and grammars
 Fundamenta Informaticae 30
, 1997
"... Investigations concerning the description of languages in terms of categorial grammar started with examining concatenation as the only syntactic operation. Type reduction systems such as associative Ajdukiewicz or Lambek calculi, which admit concatenation of types... ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Investigations concerning the description of languages in terms of categorial grammar started with examining concatenation as the only syntactic operation. Type reduction systems such as associative Ajdukiewicz or Lambek calculi, which admit concatenation of types...
3.2.1. Formal Grammars 2 3.2.2. HighLevel Syntactic Formalisms 3
"... Linguistic signs, grammar and meaning: computational logic for natural language ..."
Abstract
 Add to MetaCart
Linguistic signs, grammar and meaning: computational logic for natural language
ProjectTeam SIGNES Linguistic signs, grammar and meaning: computational logic for natural language
"... Futurs ..."
Cyclic Pregroups and Natural Language: a Computational Algebraic Analysis
"... Abstract. The calculus of pregroups is introduced by Lambek [1999] as an algebraic computational system for the grammatical analysis of natural languages. Pregroups are non commutative structures, but the syntax of natural languages shows a diffuse presence of cyclic patterns exhibited in different ..."
Abstract
 Add to MetaCart
Abstract. The calculus of pregroups is introduced by Lambek [1999] as an algebraic computational system for the grammatical analysis of natural languages. Pregroups are non commutative structures, but the syntax of natural languages shows a diffuse presence of cyclic patterns exhibited in different kinds of word order changes. The need of cyclic operations or transformations was envisaged both by Z. Harris and N. Chomsky, in the framework of generative transformational grammar. In this paper we propose an extension of the calculus of pregroups by introducing appropriate cyclic rules that will allow the grammar to formally analyze and compute word order and movement phenomena in different languages such as Persian, French, Italian, Dutch and Hungarian. This crosslinguistic analysis, although necessarily limited and not at all exhaustive, will allow the reader to grasp the essentials of a pregroup grammar, with particular reference to its straightforward way of computing linguistic information. 1