• Publications
  • Influence
Categorial grammars determined from linguistic data by unification
TLDR
We provide an algorithm for determining a categorial grammar from linguistic data that essentially uses unification of type-schemes assigned to atoms. Expand
  • 128
  • 18
Lambek Grammars Based on Pregroups
TLDR
A pregroup is a structure G such that (G,≤, ·, l, r, 1) is a partially ordered monoid. Expand
  • 85
  • 10
  • PDF
On Action Logic: Equational Theories of Action Algebras
  • W. Buszkowski
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 23 August 2006
TLDR
We prove that the equational theory of *-continuous action algebras is not recursively enumerable and they possess FMP, but action logic does not. Expand
  • 26
  • 7
Nonassociative Lambek Calculus with Additives and Context-Free Languages
TLDR
We prove that categorial grammars based on Nonassociative Lambek Calculus based on DFNL, also enriched with assumptions, generate context-free languages. Expand
  • 32
  • 5
  • PDF
Some Decision Problems in the Theory of Syntactic Categories
Suite de l'article du meme A.: "Compatibility of a categorial grammar with an associated category system" (ibid., 1982, vol. 28, p. 229-238). L'A. expose trois resultats concernant les grammairesExpand
  • 48
  • 4
Mathematical Linguistics and Proof Theory
  • W. Buszkowski
  • Mathematics, Computer Science
  • Handbook of Logic and Language
  • 1997
TLDR
This chapter discusses certain most characteristic links between proof theory and formal grammars. Expand
  • 106
  • 4
Compatibility of a Categorial Grammar With an Associated Category System
L'A. montre que la grammaire categorielle de J. Lambek presente une nette superiorite par rapport a ses rivales, et examine les grammaires categorielles du point de vue de leur completude.
  • 42
  • 4
Completeness Results for Lambek Syntactic Calculus
  • 104
  • 3
Interpolation and FEP for logics of residuated algebras
  • W. Buszkowski
  • Mathematics, Computer Science
  • Log. J. IGPL
  • 1 June 2011
TLDR
A residuated algebra is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic operations, and each n−ary basic operation is associated with n residual operations. Expand
  • 34
  • 3
  • PDF