Syntactic connectivity
Type logical grammar presents a paradigm of linguistic description based on what we may refer to as a Lambek-van Benthem correspondence: (logical) formulas as (linguistic) categories. Lexical signs are classified by category formulas, and the language model projected by a lexicon is determined by th...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97249 |
| Acceso en línea: | https://hdl.handle.net/2117/97249 |
| Access Level: | acceso abierto |
| Palabra clave: | Syntactic connectivity Proofs Syntactic structure Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | Type logical grammar presents a paradigm of linguistic description based on what we may refer to as a Lambek-van Benthem correspondence: (logical) formulas as (linguistic) categories. Lexical signs are classified by category formulas, and the language model projected by a lexicon is determined by the consequence relation induced on category formulas by their interpretation. In this logical model of language, (logical) proofs correspond to (linguistic) derivations, but such syntax serves just to calculate what is generated, not to define it. Although syntax plays no definitional role linguistically, from a computational linguistic point of view we are interested in the process of grammatical reasoning, and we propose to reinstate syntactic structure as the trace of such processing. Addressing the question `What is the essential structure of the relevant kinds of proofs?' yields a new answer to the question `What is syntactic structure?' under the slogan *proof nets as syntactic structures*. This provides a particularly vivid realisation of the notion of categorial syntactic connection of Ajdukiewicz (1935) as a harmonic mutual connectivity of the valencies of the words making up a sentence. We offer a general methodology for the development of proof nets for partially commutative categorial logics. |
|---|