Tree adjoining grammars in noncommutative linear logic

DOI10.1007/BFB0052153MaRDI QIDQ4370236zbMATH OpenFDO

Authors V. Michele Abrusci, Christophe Fouqueré, Jacqueline Vauzeilles

Publication date 14 June 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0052153

zbMATH Keywords

extension of Lambek calculuslexicalized treeslogical formalization of Tree-Adjoining Grammarnoncommutative intuitionistic linear logicparse treesproof netssequent calculus

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)

Recommendations

• Lexicalized proof-nets and TAGs
• scientific article; zbMATH DE number 475427
• scientific article; zbMATH DE number 1941335
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

Cited in

(11)

• On the degree of nondeterminism of tree adjoining languages and head grammar languages
• An LTAG perspective on categorial inference
• Lexicalized proof-nets and TAGs
• Two Equivalent Regularizations for Tree Adjoining Grammars
• scientific article; zbMATH DE number 475427 (Why is no real title available?)
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• scientific article; zbMATH DE number 1941335 (Why is no real title available?)
• Tree unification grammar: problems and proposals for topology, TAG, and German
• CoTAGs and ACGs
• An ACG view on G-TAG and its g-derivation
• Monotonic C-command: A new perspective on tree adjoining grammar

This page was built for publication: Tree adjoining grammars in noncommutative linear logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370236)