Some Decision Problems in the Theory of Syntactic Categories

DOI10.1002/malq.19820283308zbMath0499.03010OpenAlexW2023695988MaRDI QIDQ3964532

Wojciech Buszkowski

Publication date: 1982

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19820283308

zbMATH Keywords

completenessfinite modelsrecursively enumerable languagecategorial grammarLambek's syntactic calculusproduct-free typessyntactic connectionweak equivalence of grammars

Mathematics Subject Classification ID

Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (19)

On Lambek’s Restriction in the Presence of Exponential Modalities ⋮ Logical foundations for hybrid type-logical grammars ⋮ Models for the Lambek calculus ⋮ The Lambek calculus extended with intuitionistic propositional logic ⋮ Extending Lambek grammars to basic categorial grammars ⋮ Algebraic structures in categorial grammar ⋮ The displacement calculus ⋮ Categorial Grammars and Their Logics ⋮ Relational semantics of the Lambek calculus extended with classical propositional logic ⋮ Type logics and pregroups ⋮ Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability ⋮ On Associative Lambek Calculus Extended with Basic Proper Axioms ⋮ The multiplicative-additive Lambek calculus with subexponential and bracket modalities ⋮ Undecidability of the Lambek Calculus with a Relevant Modality ⋮ Subexponentials in non-commutative linear logic ⋮ UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS ⋮ Extensions of Lambek Calculi ⋮ On finite models of the Lambek calculus ⋮ COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR

This page was built for publication: Some Decision Problems in the Theory of Syntactic Categories