Some Decision Problems in the Theory of Syntactic Categories
DOI10.1002/MALQ.19820283308zbMATH Open0499.03010OpenAlexW2023695988MaRDI QIDQ3964532FDOQ3964532
Authors: 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
recursively enumerable languagecompletenesscategorial grammarfinite modelsLambek's syntactic calculusproduct-free typessyntactic connectionweak equivalence of grammars
Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Cited In (19)
- Subexponentials in non-commutative linear logic
- On Lambek’s Restriction in the Presence of Exponential Modalities
- Extensions of Lambek Calculi
- On Associative Lambek Calculus Extended with Basic Proper Axioms
- UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS
- Logical foundations for hybrid type-logical grammars
- Algebraic structures in categorial grammar
- The displacement calculus
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities
- Type logics and pregroups
- COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR
- Extending Lambek grammars to basic categorial grammars
- The Lambek calculus extended with intuitionistic propositional logic
- Relational semantics of the Lambek calculus extended with classical propositional logic
- Undecidability of the Lambek Calculus with a Relevant Modality
- Models for the Lambek calculus
- Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability
- Categorial Grammars and Their Logics
- On finite models of the Lambek calculus
This page was built for publication: Some Decision Problems in the Theory of Syntactic Categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964532)
