Computational complexity of the semantics of some natural language constructions

被引:13
|
作者
Mostowski, M [1 ]
Wojtyniak, D [1 ]
机构
[1] Warsaw Univ, Inst Philosophy, Dept Logic, PL-00047 Warsaw, Poland
关键词
NP-completeness; PTIME; Henkin quantifiers; Edmond's thesis; Church's thesis;
D O I
10.1016/j.apal.2003.11.016
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:219 / 227
页数:9
相关论文
共 50 条