摘要
广义量词的复杂性有两个层次:句法层面的复杂性和语义层面的复杂性,我们集中研究了广义量词的语义复杂性。在有穷的语境中可以找出自然语言量化语句真值的复杂性。这些复杂性与图灵机中的可计算性、作为算法的意义的等价性、计算复杂性、易处理性和不易处理性等内容相关。广义量词计算复杂性已有诸多相关研究成果。
There are two levels of complexity of generalized quantifiers syntactic level and semantic level. The paper focuses on complexity of semantic of generalized quantifiers. The complexity of the truth-values of natural language quantified sentences can be found in finite situations. The complexity is related to other contents, such as computability in Turing machines, identify of meanings-as algorithms, computational complexity, tractability and intractability. There are many related fruits in computational complexity of generalized quantifiers.
出处
《贵州工程应用技术学院学报》
2015年第4期60-64,共5页
Journal of Guizhou University Of Engineering Science
基金
国家社会科学基金西部项目"汉语语句系统的逻辑语义学研究"
项目编号:13XYY016
关键词
广义量词
计算复杂性
算法
可计算性
Generalized Quantifiers
Computational Complexity
Algorithms
Computability
