Semantic bounds for everyday language

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. First, we show that Barwise's so-called test of negation normality works properly only when assuming our main thesis. Second, 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 that are the most difficult in this class (NPTIME-complete).