Semiotica 188 (1/4):363-372 (2012)
|Abstract||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. 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).|
|Keywords||everyday language natural language semantics second–order logic finite models computational complexity|
|Through your library||Configure|
Similar books and articles
Agustín Vicente & Fernando MartínezManrique (2005). Semantic Underdetermination and the Cognitive Uses of Language. Mind and Language 20 (5):537–558.
Lucja Iwańska (1993). Logical Reasoning in Natural Language: It is All About Knowledge. Minds and Machines 3 (4):475-510.
Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Jakub Szymanik & Marcin Zajenkowski (2009). Understanding Quantifiers in Language. In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Rolf Backofen, James Rogers & K. Vijay-Shanker (1995). A First-Order Axiomatization of the Theory of Finite Trees. Journal of Logic, Language and Information 4 (1):5-39.
Chris Fox (2005). Foundations of Intensional Semantics. Blackwell Pub..
Marcin Mostowski & Jakub Szymanik (2007). Computational Complexity of Some Ramsey Quantifiers in Finite Models. The Bulletin of Symbolic Logic 13:281--282.
Ian Pratt-Hartmann (2004). Fragments of Language. Journal of Logic, Language and Information 13 (2):207-223.
Jakub Szymanik (2009). Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language. Dissertation, University of Amsterdam
Added to index2009-08-23
Total downloads55 ( #18,742 of 556,837 )
Recent downloads (6 months)1 ( #64,847 of 556,837 )
How can I increase my downloads?