Skip to main content

How Much Expressive Power Is Needed for Natural Language Temporal Indexicality?

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2011)

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

  • 529 Accesses

Abstract

The paper studies how much expressive power beyond the capabilities of the simple Priorean temporal language K t is needed to give proper translation to natural language examples by Kamp and Vlach which are extensively used in the linguistic and philosophical literature as forcing the use of quite expressive languages, all the way up to full two-sorted FOL. It turns out that when examined carefully, the examples in question only require a quite mild Kamp- and Cresswell-style system with now and then operators, or, equivalently, hybrid K t  + ↓ + @. The paper generalizes the earlier results showing that in the propositional case, now and then do not increase the power of K t . For the first-order case, a notion of FOL path bisimulation for first-order \(\mathbf{K}_t^{FO}\) with untensed quantification and equality is defined, and it is demonstrated how to prove that a particular NL sentence cannot be expressed in \(\mathbf{K}_t^{FO}\) through non-preservation under FOL path bisimulation. It is also shown that \(\mathbf{K}_t^{FO}\) plus now and then is still strictly less expressive than HL(↓, @), which is itself much less expressive than the strong systems that were claimed to be needed for NL translation. Thus the paper provides strict lower and upper bounds on the expressivity of the translation language forced by Kamp-Vlach NL sentences, and the upper bound turns out to be much lower than was widely believed in the linguistics community.

This paper has benefited greatly from my discussions with Salvador Mascarenhas, and from the comments of three anonymous WoLLIC reviewers. Remaining errors are, of course, mine alone.

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 54.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. Blackburn, P., Seligman, J.: Hybrid languages. Journal of Logic, Language and Information 4, 251–272 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cresswell, M.: Entities and Indices. Kluwer, Dordrecht (1990)

    Book  Google Scholar 

  3. Goranko, V.: Hierarchies of modal and temporal logics with reference pointers. Journal of Logic, Language and Information 5(1), 1–24 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kamp, H.: Formal properties of “now”. Theoria 37, 227–273 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  5. Meyer, U.: ‘now’ and ‘then’ in tense logic. Journal of Philosophical Logic 38(2), 229–247 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Schlenker, P.: A plea for monsters. Linguistics and Philosophy 26, 29–120 (2003)

    Article  Google Scholar 

  7. Verkuyl, H.: Binary tense. CSLI lecture notes, vol. 187. CSLI Publications, Stanford (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yanovich, I. (2011). How Much Expressive Power Is Needed for Natural Language Temporal Indexicality?. In: Beklemishev, L.D., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2011. Lecture Notes in Computer Science(), vol 6642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20920-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20920-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20919-2

  • Online ISBN: 978-3-642-20920-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics