Title of article
Computational complexity of the semantics of some natural language constructions Original Research Article
Author/Authors
Marcin Mostowski، نويسنده , , Dominika Wojtyniak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
9
From page
219
To page
227
Abstract
We consider an example of a sentence which according to Hintikkaʹs claim essentially requires for its logical form a Henkin quantifier. We show that if Hintikka is right then recognizing the truth value of the sentence in finite models is an NP-complete problem. We discuss also possible conclusions from this observation.
Keywords
NP-completeness , Henkin quantifiers , Churchיs Thesis , Edmondיs Thesis , PTIME
Journal title
Annals of Pure and Applied Logic
Serial Year
2004
Journal title
Annals of Pure and Applied Logic
Record number
889970
Link To Document