default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Buszkowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j27]Wojciech Buszkowski
:
On Involutive Nonassociative Lambek Calculus. J. Log. Lang. Inf. 28(2): 157-181 (2019)- 2016
- [c12]Wojciech Buszkowski:
On Classical Nonassociative Lambek Calculus. LACL 2016: 68-84 - 2014
- [c11]Wojciech Buszkowski:
Multi-Sorted Residuation. Categories and Types in Logic, Language, and Physics 2014: 136-155 - [c10]Wojciech Buszkowski:
An Interpretation of Full Lambek Calculus in Its Variant without Empty Antecedents of Sequents. LACL 2014: 30-43 - 2012
- [j26]Wojciech Buszkowski, Zhe Lin, Katarzyna Moroz:
Pregroup grammars with letter promotions: Complexity and context-freeness. J. Comput. Syst. Sci. 78(6): 1899-1909 (2012) - 2011
- [j25]Wojciech Buszkowski:
Interpolation and FEP for logics of residuated algebras. Log. J. IGPL 19(3): 437-454 (2011) - 2010
- [c9]Wojciech Buszkowski, Zhe Lin:
Pregroup Grammars with Letter Promotions. LATA 2010: 130-141
2000 – 2009
- 2009
- [c8]Wojciech Buszkowski, Maciej Farulewski:
Nonassociative Lambek Calculus with Additives and Context-Free Languages. Languages: From Formal to Natural 2009: 45-58 - 2008
- [j24]Wojciech Buszkowski:
On the complexsity of some substructural logics. Reports Math. Log. 43: 5-24 (2008) - [j23]Wojciech Buszkowski, Ewa Palka:
Infinitary Action Logic: Complexity, Models and Grammars. Stud Logica 89(1): 1-18 (2008) - 2007
- [j22]Wojciech Buszkowski:
Rough Sets and Learning by Unification. Fundam. Informaticae 75(1-4): 107-121 (2007) - [j21]Wojciech Buszkowski:
On Action Logic: Equational Theories of Action Algebras. J. Log. Comput. 17(1): 199-217 (2007) - [j20]Wojciech Buszkowski, Anne Preller:
Editorial Introduction. Stud Logica 87(2-3): 139-144 (2007) - [j19]Wojciech Buszkowski:
Type Logics and Pregroups. Stud Logica 87(2-3): 145-169 (2007) - 2006
- [c7]Wojciech Buszkowski:
On the Complexity of the Equational Theory of Relational Action Algebras. RelMiCS 2006: 106-119 - 2004
- [j18]Wojciech Buszkowski:
A Representation Theorem for Co-diagonalizable Algebras. Reports Math. Log. 38: 13-22 (2004) - 2003
- [j17]Wojciech Buszkowski:
Sequent systems for compact bilinear logic. Math. Log. Q. 49(5): 467-474 (2003) - [c6]Wojciech Buszkowski:
Syntactic Calculus and Pregroups. Grammars and Automata for String Processing 2003: 203-214 - [p2]Wojciech Buszkowski:
Relational Models of Lambek Logics. Theory and Applications of Relational Structures as Knowledge Instruments 2003: 196-213 - 2002
- [j16]Wojciech Buszkowski:
Finite Models of Some Substructural Logics. Math. Log. Q. 48(1): 63-72 (2002) - [j15]Wojciech Buszkowski, Michael Moortgat:
Editorial Introduction. Stud Logica 71(3): 261-275 (2002) - 2001
- [c5]Wojciech Buszkowski:
Pregroups: Models and Grammars. RelMiCS 2001: 35-49 - [c4]Wojciech Buszkowski:
Lambek Grammars Based on Pregroups. LACL 2001: 95-109
1990 – 1999
- 1998
- [j14]Wojciech Buszkowski:
Algebraic Structures in Categorial Grammar. Theor. Comput. Sci. 199(1-2): 5-24 (1998) - [c3]Wojciech Buszkowski:
More on embeddings of residuated semigroups into algebras of binary relations. RelMiCS 1998: 33-36 - [c2]Wojciech Buszkowski:
Approximation Spaces and Definability for Incomplete Information Systems. Rough Sets and Current Trends in Computing 1998: 115-122 - 1997
- [j13]Wojciech Buszkowski, Miroslawa Kolowska-Gawiejnowics:
Representation of Residuated Semigroups in Some Algebras of Relations (The Method of Canonical Models). Fundam. Informaticae 31(1): 1-12 (1997) - [p1]Wojciech Buszkowski:
Mathematical Linguistics and Proof Theory. Handbook of Logic and Language 1997: 683-736 - 1996
- [j12]Wojciech Buszkowski:
Extending Lambek Grammars to Basic Categorial Grammars. J. Log. Lang. Inf. 5(3/4): 279-295 (1996) - [j11]Wojciech Buszkowski:
The finite model property for BCI. Stud Logica 57(2/3): 303-323 (1996) - 1990
- [j10]Wojciech Buszkowski, Gerald Penn:
Categorial grammars determined from linguistic data by unification. Stud Logica 49(4): 431-454 (1990) - [c1]Wojciech Buszkowski:
On Generative Capacity of the Lambek Calculus. JELIA 1990: 139-152
1980 – 1989
- 1989
- [j9]Wojciech Buszkowski:
Presuppositional completeness. Stud Logica 48(1): 23-34 (1989) - 1988
- [j8]Wojciech Buszkowski:
Gaifman's theorem on categorial grammars revisited. Stud Logica 47(1): 23-33 (1988) - 1986
- [j7]Wojciech Buszkowski:
Completeness Results for Lambek Syntactic Calculus. Math. Log. Q. 32(1-5): 13-28 (1986) - [j6]Wojciech Buszkowski:
Embedding Boolean Structures into Atomic Boolean Structures. Math. Log. Q. 32(13-16): 227-228 (1986) - 1985
- [j5]Wojciech Buszkowski:
Concerning the Axioms of Ackermann's Set Theory. Math. Log. Q. 31(1-6): 63-70 (1985) - [j4]Wojciech Buszkowski:
The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars. Math. Log. Q. 31(24): 369-384 (1985) - 1982
- [j3]Wojciech Buszkowski:
Compatibility of a Categorial Grammar With an Associated Category System. Math. Log. Q. 28(14-18): 229-238 (1982) - [j2]Wojciech Buszkowski:
Some Decision Problems in the Theory of Syntactic Categories. Math. Log. Q. 28(33-38): 539-548 (1982) - 1980
- [j1]Wojciech Buszkowski:
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata. Math. Log. Q. 26(1-6): 41-49 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
