On the complexity of nonassociative Lambek calculus with unit
type: Item
instance of: scholarly article
title: On the complexity of nonassociative Lambek calculus with unit
zbMATH Open document ID: 1182.03041
author: Maria Bulińska
published in: Studia Logica
publication date: 2009-11-04T00:00:00Z
Mathematics Subject Classification ID: 03B47
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5625031
zbMATH Keywords: nonassociative Lambek calculus
zbMATH Keywords: PTIME decidability
zbMATH Keywords: Lambek grammar
zbMATH Keywords: context-free grammar
MaRDI profile type: Publication
full work available at URL: s11225-009-9205-2
OpenAlex ID: W2061837253
cites work: The Pentus theorem for Lambek calculus with simple nonlogical axioms
cites work: Q3754605
cites work: Classical non-associative Lambek calculus
cites work: Residuation, structural rules and context freeness
cites work: The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
cites work: The Mathematics of Sentence Structure
cites work: Q4263075
DOI: 10.1007/S11225-009-9205-2
Recommended article: Q4263011
Recommended article: Involutive Nonassociative Lambek Calculus: Sequent Systems and Complexity
Recommended article: Q4014404
Recommended article: Complexity of the Lambek calculus and its fragments
Recommended article: Q3035262
Recommended article: The complexity of multiplicative-additive Lambek calculus: 25 years later
Recommended article: Nonassociative Lambek Calculus with Additives and Context-Free Languages
Recommended article: A rule-extension of the non-associative Lambek calculus
Recommended article: Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness
Recommended article: On the poset of computation rules for nonassociative calculus
description: scientific article; zbMATH DE number 5625031