Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • Stage 3 - Composing Sentence Meaning

  • Kasia M. Jaszczolt, University of Cambridge
  • Book:
    Semantics, Pragmatics, Philosophy
    Published online:
    22 March 2023
    Print publication:
    16 March 2023, pp 44-76

  • Summary

    This stage of the journey offers an explanation of how truth conditions and truth-value judgements can be used in understanding sentence meaning, moving on to the role of a formal metalanguage, possible worlds, and models. As ‘food for thought’, it focuses on the importance of selecting a suitable formal language, introducing some options available in the formal semantic tradition, as well as on the cognitive reality of such approaches to meaning.

  • COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY

  • Part of
  • PETER PAGIN
  • Journal:
    The Review of Symbolic Logic / Volume 14 / Issue 3 / September 2021
    Published online by Cambridge University Press:
    29 June 2020, pp. 551-591
    Print publication:
    September 2021

  • This paper starts from the observation that the standard arguments for compositionality are really arguments for the computability of semantics. Since computability does not entail compositionality, the question of what justifies compositionality recurs. The paper then elaborates on the idea of recursive semantics as corresponding to computable semantics. It is then shown by means of time complexity theory and with the use of term rewriting as systems of semantic computation, that syntactically unrestricted, noncompositional recursive semantics leads to computational explosion (factorial complexity). Hence, with combinatorially unrestricted syntax, semantics with tractable time complexity is compositional.