Lambek calculus and its relational semantics: Completeness and incompleteness

DOI10.1007/BF01066355zbMath0808.03003OpenAlexW1585815400MaRDI QIDQ1314508

Szabolcs Mikulás, Hajnalka Andréka

Publication date: 3 March 1994

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01066355

zbMATH Keywords

relational semanticsalgebraic logicrepresentation theoremsresiduated semigroupsfragments of Girard's Linear LogicLambek Calculuslanguage modelsrelational Kripke-models

Mathematics Subject Classification ID

Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

Models for the Lambek calculus ⋮ Reducts of relation algebras: the aspects of axiomatisability and finite representability ⋮ Language-theoretic and finite relation models for the (full) Lambek calculus ⋮ Complexity of equations valid in algebras of relations. II: Finite axiomatizations ⋮ Coalgebraic completeness-via-canonicity for distributive substructural logics ⋮ Algebraic structures in categorial grammar ⋮ Unitless Frobenius quantales ⋮ Versions of a local contraction subexponential in the Lambek calculus ⋮ Relational Models for the Lambek Calculus with Intersection and Constants ⋮ Relational models for the Lambek calculus with intersection and unit ⋮ A restricted fragment of the Lambek calculus with iteration and intersection operations ⋮ Axiomatizability of positive algebras of binary relations ⋮ The categorical imperative: category theory as a foundation for deontic logic ⋮ POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS ⋮ Grammar specification in categorial logics and theorem proving ⋮ The equational theories of representable residuated semigroups ⋮ Unnamed Item ⋮ Relational semantics and a relational proof system for full Lambek calculus ⋮ Using tableaux to automate the Lambek and other categorial calculi ⋮ A Labelled Deductive System for Relational Semantics of the Lambek Calculus ⋮ Lower semilattice-ordered residuated semigroups and substructural logics ⋮ COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR

Cites Work

• On the strength of temporal proofs
• On taking subalgebras of relativized relation algebras
• Language in action
• Algebraization of quantifier logics, an introductory overview
• Relation algebras as residuated Boolean algebras
• Adjoining units to residuated Boolean algebras
• Relations and non-commutative linear logic
• Representations of distributive lattice-ordered semigroups with binary relations
• Lambek calculus is NP-complete
• The Mathematics of Sentence Structure
• Completeness Results for Lambek Syntactic Calculus
• Representations of ordered semigroups and lattices by binary relations
• Unnamed Item
• Unnamed Item