Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Mati Pentus

dblp:53/4071 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2010
0000-0002-9483-7594ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 6 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Logic in computer science · 77% Automata and formal languages · 23%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › proof theory › substructural logic
lambek calculus		 0.021994
Language Completeness of the Lambek Calculus · LICS 1994
Lambek Grammars Are Context Free · LICS 1993
Logic in computer science › proof theory
substructural logic		 0.021994
Language Completeness of the Lambek Calculus · LICS 1994
Lambek Grammars Are Context Free · LICS 1993
Logic in computer science
completeness		 0.011994
Language Completeness of the Lambek Calculus · LICS 1994
Logic in computer science
proof theory		 0.011994
Language Completeness of the Lambek Calculus · LICS 1994
Automata and formal languages
context-free languages		 0.011993
Lambek Grammars Are Context Free · LICS 1993
Automata and formal languages
formal grammars		 0.011993
Lambek Grammars Are Context Free · LICS 1993

Methods — techniques the papers use, named apart from their topics

semigroup model · 0.0model theory · 0.0proof theory · 0.0cut elimination · 0.0
YearPublicationVenuePosition
2010 Complexity of the Lambek Calculus and Its Fragments
Mati Pentus
 Advances in Modal Logic1
2006 Lambek calculus is NP-complete
Mati Pentus
 Theor. Comput. Sci.1
1997 Product-Free Lambek Calculus and Context-Free Grammars
abstract
Abstract In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are context-free) for both the full Lambek calculus and its product-free fragment. For the latter case we present a construction of context-free grammars involving only product-free types.
Mati Pentus
 J. Symb. Log.1
1995 Models for the Lambek Calculus
Mati Pentus
 Ann. Pure Appl. Log.1
1994 Language Completeness of the Lambek Calculus
abstract
Proves that the Lambek calculus (J. Lambek, American Math. Monthly, vol. 65, no. 3, pp. 154-170, 1958), which is essentially a subsystem of noncommutative linear logic, is complete with respect to L-models, i.e. free semigroup models.>
Mati Pentus
 LICS1
1993 Lambek Grammars Are Context Free
abstract
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are con-text free.
Mati Pentus
 LICS1