Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logical Aspects of Computational Linguistics

LACL 1996: Logical Aspects of Computational Linguistics pp 118–133Cite as

Constructing different phonological bracketings from a proof net

  • Selected Papers
  • Conference paper
  • First Online:

  • 110 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1328))

Abstract

We state and prove Roorda's interpolation theorem in the framework of proof-net theory. This allows us to transform any proofnet into some other proof-net that matches some given (phonological or prosodic) bracketing.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge. Graphs. North-Holland, second revised edition edition, 1985.

    Google Scholar 

  2. W. Buszkowski. Generative power of categorial grammars. In R. T. Oehrle, E. Bach, and D. Wheeler, editors, Categorial Grammars and Natural Languages Structures, pages 69–94. Reidel, 1988.

    Google Scholar 

  3. V. Danos. Une application de la logique linéaire à l'étude des processus de normalisation et principalement du lambda calcul. Thèse de doctorat, Université de Paris VII, 1990.

    Google Scholar 

  4. V. Danos and L. Regnier. The structure of multiplicatives. Archive for Mathematical Logic, 28:181–203, 1989.

    Article  MathSciNet  Google Scholar 

  5. Ph. de Groote and C. Retoré. On the semantic readings of proof-nets. In G.-J. Kruijff, G. Morrill, and D. Oehrle, editors, Formal Grammar, pages 57–70. Eighth European Summer School in Logic Language and Information, August 1996.

    Google Scholar 

  6. A. Fleury. Private communication.

    Google Scholar 

  7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  8. J.-Y. Girard. Quantifiers in linear logic II. Technical Report 19, Equipe de Logique Mathématique, Université de Paris VII, 1991.

    Google Scholar 

  9. J. Lambek. The mathematics of sentence structure. Amer. Math. Monthly, 65:154–170, 1958.

    Article  MathSciNet  Google Scholar 

  10. A. Lecomte. Prosodie et stratégie de calcul. Communication à la journée ATALA “Interaction prosodie-syntaxe”, Février 1996.

    Google Scholar 

  11. A. Lecomte and C. Retoré. Pomset logic as an alternative categorial grammar. In Proceedings of the Conference of the European Summer School in Logic, Language and Information, Barcelona, 1995.

    Google Scholar 

  12. M. Moortgat. Categorial Investigations: logical and linguistic aspects of the lambek calculus. Foris Publications, 1988.

    Google Scholar 

  13. M. Moortgat. Categorial type logic. In J. van Benthem and A. ter Meulen, editors, Handbook of Logic and Language, chapter two. Elsevier, to appear.

    Google Scholar 

  14. G. Morrill. Memoisation of categorial proof nets: parallelism in categorial processing. In V. M. Abrusci and C. Casadio, editors, Proofs and Linguistic Categories, Proceedings 1996 Roma Workshop. CLUEB, 1996.

    Google Scholar 

  15. C. Retoré. Calcul de lambek et logique linéaire. Traitement Automatique de Langues, 37(2):39–70, 1997.

    Google Scholar 

  16. D. Roorda. Resource Logics: proof-theoretical investigations. PhD thesis, University of Amsterdam, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Projet Calligramme, INRIA-Lorraine - CRIN - CNRS, 615, rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France

    Denis Bechet & Philippe de Groote

Authors
  1. Denis Bechet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe de Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bechet, D., de Groote, P. (1997). Constructing different phonological bracketings from a proof net. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052154

Download citation

  • DOI: https://doi.org/10.1007/BFb0052154

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63700-4

  • Online ISBN: 978-3-540-69631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation