Everyday language is easy to understand. We claim that it is bounded by Σ 1 1-properties. Only then Barwise’s test of negation normality works. In finite universe Σ1 1-sentences are (in)directly verifiable
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.