Skip to main content

A Predicative Operator and Underspecification by the Type Theory of Acyclic Recursion

  • Conference paper
Constraint Solving and Language Processing (CSLP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8114))

Included in the following conference series:

Abstract

This paper provides an introduction of the formal apparatus of the algorithmic calculus of Moschovakis’ type theory of acyclic recursion L\(_{\rm ar}^{\lambda}\) for procedural semantics of predicative constructions. We introduce a generalized predicative operator in the formal language of acyclic recursion L\(_{\rm ar}^{\lambda}\), for algorithmic representation of semantic underspecification. The paper investigates the potential use of such an operator for computational semantics of human language and algorithmic classification of predicative expressions.

I am grateful to anonymous referees for many useful suggestions and corrections.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J., Perry, J.: Situations and Attitudes. MIT Press, Cambridge (1983), republished as [2]

    Google Scholar 

  2. Barwise, J., Perry, J.: Situations and Attitudes. The Hume Series. CSLI Publications, Stanford (1999)

    MATH  Google Scholar 

  3. Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal recursion semantics: an introduction. Research on Language and Computation 3, 281–332 (2005)

    Article  Google Scholar 

  4. Gallin, D.: Intensional and Higher-Order Modal Logic. North-Holland (1975)

    Google Scholar 

  5. Hamm, F., Van Lambalgen, M.: Moschovakis’ notion of meaning as applied to linguistics. Logic Colloqium 1 (2004)

    Google Scholar 

  6. Hurkens, A.J.C., McArthur, M., Moschovakis, Y.N., Moss, L.S., Whitney, G.T.: The logic of recursive equations. Journal of Symbolic Logic, 451–478 (1998)

    Google Scholar 

  7. Kalyvianaki, E., Moschovakis, Y.N.: Two aspects of situated meaning. Logics for linguistic structures, pp. 57–86. Mouton de Gruyter, Berlin (2008)

    Google Scholar 

  8. Loukanova, R.: Typed lambda language of acyclic recursion and scope underspecification. In: Muskens, R. (ed.) Workshop on New Directions in Type-Theoretic Grammars, ESSLLI 2007, pp. 73–89. The Association for Logic, Language and Information, Dublin (2007)

    Google Scholar 

  9. Loukanova, R.: From Montague’s rules of quantification to minimal recursion semantics and the language of acyclic recursion. In: Bel-Enguix, G., Dahl, V., Jiménez-López, M.D. (eds.) Biology, Computation and Linguistics — New Interdisciplinary Paradigms, Frontiers in Artificial Intelligence and Applications, vol. 228, pp. 200–214. IOS Press, Amsterdam (2011)

    Google Scholar 

  10. Loukanova, R.: Modeling context information for computational semantics with the language of acyclic recursion. In: Pérez, J.B., Corchado, J.M., Moreno, M.N., Julián, V., Mathieu, P., Canada-Bago, J., Ortega, A., Caballero, A.F. (eds.) Highlights in Practical Applications of Agents and Multiagent Systems. AISC, vol. 89, pp. 265–274. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Loukanova, R.: Reference, co-reference and antecedent-anaphora in the type theory of acyclic recursion. In: Bel-Enguix, G., Jiménez-López, M.D. (eds.) Bio-Inspired Models for Natural and Formal Languages, pp. 81–102. Cambridge Scholars Publishing (2011)

    Google Scholar 

  12. Loukanova, R.: Semantics with the language of acyclic recursion in constraint-based grammar. In: Bel-Enguix, G., Jiménez-López, M.D. (eds.) Bio-Inspired Models for Natural and Formal Languages, pp. 103–134. Cambridge Scholars Publishing (2011)

    Google Scholar 

  13. Loukanova, R.: Syntax-semantics interface for lexical inflection with the language of acyclic recursion. In: Bel-Enguix, G., Dahl, V., Jiménez-López, M.D. (eds.) Biology, Computation and Linguistics — New Interdisciplinary Paradigms, Frontiers in Artificial Intelligence and Applications, vol. 228, pp. 215–236. IOS Press, Amsterdam (2011)

    Google Scholar 

  14. Loukanova, R.: Algorithmic semantics of ambiguous modifiers by the type theory of acyclic recursion. In: The IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology — Workshops, pp. 117–121 (2012)

    Google Scholar 

  15. Loukanova, R.: Semantic information with type theory of acyclic recursion. In: Huang, R., Ghorbani, A.A., Pasi, G., Yamaguchi, T., Yen, N.Y., Jin, B. (eds.) AMT 2012. LNCS, vol. 7669, pp. 387–398. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Moschovakis, Y.N.: Sense and denotation as algorithm and value. In: Oikkonen, J., Vaananen, J. (eds.) Lecture Notes in Logic, vol. 2, pp. 210–249. Springer (1994)

    Google Scholar 

  17. Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguistics and Philosophy 29, 27–89 (2006)

    Article  Google Scholar 

  18. Ranta, A.: Grammatical Framework: Programming with Multilingual Grammars. CSLI Publications, Stanford (2011)

    Google Scholar 

  19. Reichenbach, H.: Elements of Symbolic Logic. Macmillan, London (1947)

    Google Scholar 

  20. Thomason, R.H. (ed.): Formal Philosophy: Selected Papers of Richard Montague. Yale University Press, New Haven (1974), edited, with an introduction, by Thomason, R.H.

    Google Scholar 

  21. Van Lambalgen, M., Hamm, F.: The Proper Treatment Of Events. Explorations in Semantics. Wiley-Blackwell, Oxford (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loukanova, R. (2013). A Predicative Operator and Underspecification by the Type Theory of Acyclic Recursion. In: Duchier, D., Parmentier, Y. (eds) Constraint Solving and Language Processing. CSLP 2012. Lecture Notes in Computer Science, vol 8114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41578-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41578-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41577-7

  • Online ISBN: 978-3-642-41578-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics