A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
We consider the notion of everyday language. We claim that everyday language is semantically bounded by the 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 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.doi:10.1515/sem-2012-0022 fatcat:4tqhhovjw5gm3orju7grqlozrq