Pages that link to "Item:Q4358060"

The following pages link to Product-free Lambek calculus and context-free grammars (Q4358060):

Displaying 19 items.

• The Pentus theorem for Lambek calculus with simple nonlogical axioms (Q817678) (← links)
• Algebraic structures in categorial grammar (Q1129119) (← links)
• On the recognizing power of the Lambek calculus with brackets (Q1630945) (← links)
• Lambek calculus for transformational grammar (Q1768811) (← links)
• A note on the strong and weak generative powers of formal systems (Q1870566) (← links)
• Powerful and NP-complete: hypergraph Lambek grammars (Q2117261) (← links)
• A restricted fragment of the Lambek calculus with iteration and intersection operations (Q2213927) (← links)
• Kleene star, subexponentials without contraction, and infinite computations (Q2234420) (← links)
• S4 enriched multimodal categorial grammars are context-free (Q2464941) (← links)
• Parsing pregroup grammars and Lambek calculus using partial composition (Q2467213) (← links)
• Computing interpolants in implicational logics (Q2503400) (← links)
• Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
• (Q4358450) (← links)
• The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable (Q4923557) (← links)
• A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus (Q4923572) (← links)
• Pomset Logic (Q5014600) (← links)
• The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars (Q5327381) (← links)
• Extended Lambek Calculi and First-Order Linear Logic (Q5414971) (← links)
• Logical Aspects of Computational Linguistics (Q5706925) (← links)