# Wojciech Buszkowski

According to our database

Collaborative distances:

^{1}, Wojciech Buszkowski authored at least 38 papers between 1980 and 2016.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2016

On Classical Nonassociative Lambek Calculus.

Proceedings of the Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996-2016), 2016

2014

An Interpretation of Full Lambek Calculus in Its Variant without Empty Antecedents of Sequents.

Proceedings of the Logical Aspects of Computational Linguistics, 2014

Multi-Sorted Residuation.

Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2012

Pregroup grammars with letter promotions: Complexity and context-freeness.

J. Comput. Syst. Sci., 2012

2011

Interpolation and FEP for logics of residuated algebras.

Logic Journal of the IGPL, 2011

2010

Pregroup Grammars with Letter Promotions.

Proceedings of the Language and Automata Theory and Applications, 2010

2009

Nonassociative Lambek Calculus with Additives and Context-Free Languages.

Proceedings of the Languages: From Formal to Natural, 2009

2008

Infinitary Action Logic: Complexity, Models and Grammars.

Studia Logica, 2008

On the complexsity of some substructural logics.

Reports on Mathematical Logic, 2008

2007

Editorial Introduction.

Studia Logica, 2007

Type Logics and Pregroups.

Studia Logica, 2007

On Action Logic: Equational Theories of Action Algebras.

J. Log. Comput., 2007

Rough Sets and Learning by Unification.

Fundam. Inform., 2007

2006

On the Complexity of the Equational Theory of Relational Action Algebras.

Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

2004

A Representation Theorem for Co-diagonalizable Algebras.

Reports on Mathematical Logic, 2004

2003

Sequent systems for compact bilinear logic.

Math. Log. Q., 2003

Syntactic Calculus and Pregroups.

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

Relational Models of Lambek Logics.

Proceedings of the Theory and Applications of Relational Structures as Knowledge Instruments, 2003

2002

Editorial Introduction.

Studia Logica, 2002

Finite Models of Some Substructural Logics.

Math. Log. Q., 2002

2001

Lambek Grammars Based on Pregroups.

Proceedings of the Logical Aspects of Computational Linguistics, 2001

Pregroups: Models and Grammars.

Proceedings of the Relational Methods in Computer Science, 2001

1998

Algebraic Structures in Categorial Grammar.

Theor. Comput. Sci., 1998

Approximation Spaces and Definability for Incomplete Information Systems.

Proceedings of the Rough Sets and Current Trends in Computing, 1998

More on embeddings of residuated semigroups into algebras of binary relations.

Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997

Representation of Residuated Semigroups in Some Algebras of Relations (The Method of Canonical Models).

Fundam. Inform., 1997

1996

The finite model property for BCI.

Studia Logica, 1996

Extending Lambek Grammars to Basic Categorial Grammars.

Journal of Logic, Language and Information, 1996

1990

Categorial grammars determined from linguistic data by unification.

Studia Logica, 1990

On Generative Capacity of the Lambek Calculus.

Proceedings of the Logics in AI, European Workshop, 1990

1989

Presuppositional completeness.

Studia Logica, 1989

1988

Gaifman's theorem on categorial grammars revisited.

Studia Logica, 1988

1986

Embedding Boolean Structures into Atomic Boolean Structures.

Math. Log. Q., 1986

Completeness Results for Lambek Syntactic Calculus.

Math. Log. Q., 1986

1985

Concerning the Axioms of Ackermann's Set Theory.

Math. Log. Q., 1985

1982

Some Decision Problems in the Theory of Syntactic Categories.

Math. Log. Q., 1982

Compatibility of a Categorial Grammar With an Associated Category System.

Math. Log. Q., 1982

1980

Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata.

Math. Log. Q., 1980