Skip to main content
SpringerLink
Log in

Generalized Computable Models and Montague Semantics

  • Chapter
  • First Online:
Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 1081))

  • 218 Accesses

Abstract

We consider algorithmic properties of mathematical models which are used in computational linguistics to formalize and represent the semantics of natural language sentences. For example, finite-order functionals play a crucial role in Montague intensional logic and formal semantics for natural languages. We discuss some computable models for the spaces of finite-order functionals based on the Ershov-Scott theory of domains and approximation spaces. As another example, in the analysis of temporal aspects of verbs the scale of time is usually identified with the ordered set of real numbers or just a dense linear order. There are many results in generalized computability about such structures, and some of them can be applied in this analysis.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Barwise, J.: Admissible Sets and Structures. Springer Verlag, Heidelberg (1975)

    Book  MATH  Google Scholar 

  2. Bennett, M., Partee, B.: Toward the logic of tense and aspect in english. In: Partee, B. (ed.) Compositionality in Formal Semantics: Selected Papers by Barbara H. Partee, pp. 59–109. Blackwell Publishing (2004). https://doi.org/10.1002/9780470751305.ch4

  3. Burnistov, A., Stukachev, A.: Computable functional of finite types in montague semantics. Lecture Notes in Computer Science, to appear (2022). http://www.math.nsc.ru/stukachev/CompFunct_MS.pdf

  4. Dowty, D.: Word Meaning and Montague Grammar. D. Reidel Publishing Company, Dodrecht (1979)

    Book  Google Scholar 

  5. Dowty, D.: Introduction to Montague Semantics. D. Reidel Publishing Company, Dodrecht (1989)

    Google Scholar 

  6. Ershov, Y.: The theory of \(A\)-spaces. Algebra and Logic 12(4), 209–232 (1973). https://doi.org/10.1007/BF02218570

  7. Ershov, Y.: Theory of domains and nearby. Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science 735, 1–7 (1993). https://doi.org/10.1007/BFb0039696

  8. Ershov, Y.: Definability and Computability. Plenum, New York (1996)

    MATH  Google Scholar 

  9. Montague, R.: Recursion theory as a branch of model theory. In: Proceedings of the Third International Congress for Logic, Methodology and Philosophy of Science, pp. 63–86. North-Holland, Amsterdam (1967)

    Google Scholar 

  10. Montague, R.: The proper treatment of quantification in ordinary english. In: Hintikka, J., Moravcsik, J., Suppes, P. (eds.) Approaches to Natural Language, pp. 221–242. D. Reidel Publishing Company, Dodrecht (1973)

    Chapter  Google Scholar 

  11. Montague, R.: English as a formal language. In: B.V. et al. (ed.) Linguaggi nella Societa a nella Tecnica, pp. 189–224. Edizioni di Comunita, Milan (1974). Reprinted in: Formal Philosophy: selected papers of Richard Montegue, pp. 108–121

    Google Scholar 

  12. Moschovakis, Y.: Elementary Induction on Abstract Structures. North-Holland (1974)

    Google Scholar 

  13. Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguist. Philos. 29, 27–89 (2006). https://doi.org/10.1007/s10988-005-6920-7

  14. Scott, D.: Outline of a mathematical theory of computation. Proceedings of the 4th Annual Princeton Conference on Information Sciences and Systems pp. 169–176 (1970)

    Google Scholar 

  15. Stukachev, A.: Effective model theory: an approach via \(\Sigma \)-definability. Lecture Notes in Logic 41, 164–197 (2013). https://doi.org/10.1017/CBO9781139028592.010

    Article  MathSciNet  MATH  Google Scholar 

  16. Stukachev, A.: Interval extensions of orders and temporal approximation spaces. Siberian Math. J. 62(4), 730–741 (2021). https://doi.org/10.1134/s0037446621040157

  17. Stukachev, A.I.: Approximation spaces of temporal processes and effectivenes of interval semantics. Adv. Intell. Syst. Comput. 1242, 53–61 (2021). https://doi.org/10.1007/978-3-030-53829-3_5

    Article  Google Scholar 

Download references

Acknowlegements

The research was supported by the IM SB RAS state assignment, project number FWNF-2022-0012.

Author information

Authors and Affiliations

  1. Novosibirsk State University, 1 Pirogova str., Novosibirsk, 630090, Russia

    Artem Burnistov & Alexey Stukachev

  2. Mines Paris, PSL University, 60 bd Saint-Michel, Paris, 75006, France

    Artem Burnistov

  3. Sobolev Institute of Mathematics, 4 Acad.Koptyug avenue, Novosibirsk, 630090, Russia

    Alexey Stukachev

  4. Novosibirsk State Technical University, 20 Prospekt K. Marksa, Novosibirsk, 630073, Russia

    Alexey Stukachev

Authors
  1. Artem Burnistov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexey Stukachev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexey Stukachev .

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria

    Roussanka Loukanova

  2. Department of Mathematics, Faculty of Science, Stockholm University, Stockholm, Sweden

    Peter LeFanu Lumsdaine

  3. Faculty of Science, ILLC—Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands

    Reinhard Muskens

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Burnistov, A., Stukachev, A. (2023). Generalized Computable Models and Montague Semantics. In: Loukanova, R., Lumsdaine, P.L., Muskens, R. (eds) Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021). Studies in Computational Intelligence, vol 1081. Springer, Cham. https://doi.org/10.1007/978-3-031-21780-7_5

Download citation

Publish with us

Policies and ethics

Search

Navigation