PP-2006-40: Semantical bounds for everyday language

PP-2006-40: Mostowski, Marcin and Szymanik, Jakub (2006) Semantical bounds for everyday language. [Report]

[thumbnail of Full Text]
Text (Full Text)

Download (172kB) | Preview
[thumbnail of Abstract] Text (Abstract)

Download (939B)
[thumbnail of Full Text (Jun 2006 version)]
Text (Full Text (Jun 2006 version))

Download (172kB) | Preview


We consider the notion of "everyday language". We claim that everyday
language is semantically bounded by properties expressible in the
existential fragment of second-order logic. Two arguments for this
thesis are formulated. Firstly, we show that so-called Barwise's test
of negation normality (Barwise 1979) works properly only when assuming
our main thesis. Secondly, we discuss the argument from practical
computability for finite universes. Everyday language sentences are
directly or indirectly verifiable. We show that in both cases they are
bounded by second-order existential properties. Moreover, there are
known examples of everyday language sentences which are the most
difficult in this class ($NPTIME$-complete, see Mostowski &
Wojtyniak, 2004).

Item Type: Report
Report Nr: PP-2006-40
Series Name: Prepublication (PP) Series
Year: 2006
Uncontrolled Keywords: everyday language, natural language, semantics, second-order logic, finite models
Subjects: Language
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/215

Actions (login required)

View Item View Item