Some Decision Problems in the Theory of Syntactic Categories

DOI10.1002/MALQ.19820283308MaRDI QIDQ3964532zbMATHOpenAlexFDO

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

zbMATH Keywords

recursively enumerable languagecompletenesscategorial grammarfinite modelsLambek'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)

Cited in

(19)

• On Lambek's restriction in the presence of exponential modalities
• Extending Lambek grammars to basic categorial grammars
• The displacement calculus
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities
• Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability
• Subexponentials in non-commutative linear logic
• Models for the Lambek calculus
• Logical foundations for hybrid type-logical grammars
• On finite models of the Lambek calculus
• Type logics and pregroups
• Categorial grammars and their logics
• Algebraic structures in categorial grammar
• Complexity of the infinitary Lambek calculus with Kleene star
• Relational semantics of the Lambek calculus extended with classical propositional logic
• Extensions of Lambek calculi
• The Lambek calculus extended with intuitionistic propositional logic
• Undecidability of consequence relation in full non-associative Lambek calculus
• Undecidability of the Lambek calculus with a relevant modality
• On associative Lambek calculus extended with basic proper axioms

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)