NobleBlocks
Public

COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY

Published in The Review of Symbolic Logic • Jun 29, 2020
NobleIDNI8P50W66R10S89
Authors:
Peter Pagin

Abstract

Abstract 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 ide...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!