Completeness Results for Lambek Syntactic Calculus
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1567840
- Completeness of full Lambek calculus for syntactic concept lattices
- A Completeness Theorem for the Lambek Calculus of Syntactic Categories
- scientific article; zbMATH DE number 3871337
- Typed Lambda Calculi and Applications
- On the completeness of Lambek calculus with respect to cofinite language models
- Lambek calculus and its relational semantics: Completeness and incompleteness
- scientific article; zbMATH DE number 475195
- Publication:4503959
- On the completeness of the Lambek calculus with respect to relativized relational semantics
Cited in
(44)- Sequent-systems and groupoid models. I
- Algebraic structures in categorial grammar
- Language in action
- Sequent-systems and groupoid models. II
- Lambek calculus and its relational semantics: Completeness and incompleteness
- On the completeness of the Lambek calculus with respect to relativized relational semantics
- Meeting strength in substructural logics
- On completeness theorems for feature logics
- A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi
- Models for the Lambek calculus
- Some lattice models of bilinear logic
- Tree models and (labeled) categorial grammar
- Extending Lambek grammars to basic categorial grammars
- Fibred semantics for feature-based grammar logic
- The atomic theory of division and intersection of semiring ideals
- Lambek calculus with conjugates
- Language-theoretic and finite relation models for the (full) Lambek calculus
- Epistemic closure and commutative, nonassociative residuated structures
- The atomic theory of multiplication and division of semiring ideals
- Type logics and pregroups
- The finite model property for BCI and related systems
- Embedding of the atomic theory of subsets of free semigroups to the atomic theory of subsets of free monoids
- Models for the Displacement Calculus
- On some extensions of syntactic concept lattices: completeness and finiteness results
- Syntactic characterizations of completeness using duals and operators
- Automatic concepts and automata-theoretic semantics for the full Lambek calculus
- scientific article; zbMATH DE number 2185676 (Why is no real title available?)
- scientific article; zbMATH DE number 3871337 (Why is no real title available?)
- The atomic theory of left division of two-sided ideals of semirings with unit
- Completeness of transfinite evaluation in an extension of the lambda calculus
- The Smyth Completion
- A Labelled Deductive System for Relational Semantics of the Lambek Calculus
- scientific article; zbMATH DE number 475195 (Why is no real title available?)
- A comparison between monoidal and substructural logics
- The categorical imperative: category theory as a foundation for deontic logic
- scientific article; zbMATH DE number 1567840 (Why is no real title available?)
- L-Completeness of the Lambek Calculus with the Reversal Operation
- Revisiting Semilattice Semantics
- Syntactic Completeness of Proper Display Calculi
- Some syntactic interpretations in different systems of full Lambek calculus
- Completeness of full Lambek calculus for syntactic concept lattices
- The monotone Lambek calculus is NP-complete
- Relational Models for the Lambek Calculus with Intersection and Constants
- Complexity of equational theories for relational and language action lattices
This page was built for publication: Completeness Results for Lambek Syntactic Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724306)