谓词演算

This theory emerged from those philosophical and logical inquires Russell made in his early stage, when Russell use logical analysis to solve the semantics problem his meaning theory suffered. The foundation of the theory of descriptions is a theory of meaning, as this thesis presents, and its central notion includes two syntax rules. Based on the first order predicates calculus, this theory seems successfully solve some notable semantics problems and then assures Russell's denotation theory.

本文认为，摹状词理论有深刻的哲学渊源，它脱胎于罗素早期的哲学和逻辑研究，直接缘起于罗素想要利用逻辑的分析方法去解决意义指谓论所面临的语义学难题；摹状词理论的基础是它的意义理论，核心是两个句法规则，它基于带等词的一阶谓词演算成功地解决了一些著名的语义学难题，维护了直观的指谓论，从而产生了巨大而深刻的哲学影响。

Predicate Calculus language of the traditional semantic component of the mathematical logic of a very rich branch.

谓词演算语言的传统的语义组成了数理逻辑的一个很丰富的分支。

In order to match the predicate calculus,the relational database model was selected as the basic data model.

为与谓词演算相配合，关系数据库模型被选作基本数据模型。

This kind of assertion seems to require special language extensions and has led people to suggest introducing first-order predicate calculus.

这种情况下的断言似乎就需要实现特定的语言扩展，于是一些人建议引入一阶谓词演算。

Thus a kind of new syntactical and semantical systems of fuzzy predicate calculus are formed.

从而形成了模糊谓词演算一种新的语构与语义体系。

Also, first-order predicate calculus isn't good enough anyway.

同时，从各方面来说，一阶谓词演算都不是足够好。

In particular, the authors' original formulation of Gdel's completeness proof for the predicate calculus has been updated.

尤其是，作者们哥德尔完备性证明原制定的谓词演算已被更新。

In the predicate calculus, a connector connecting two conjunctive formulas denoted by sign ∧or∩.

在谓词演算中，一种连接二个合式公式的连接符，用符号∧或∩表示。

This has led some people who design the specification mechanisms for programming languages, or in the case of UML, for modeling languages, to include facilities from first-order predicate calculus as a language extension.

这就促使一些人在编程语言的描述机制和建模语言处理机制中加进了部分一阶谓词演算的东西，作为一种功能扩展。

Resolution-based many-sorted predicate calculus has been applied to many fields of computer science, such as knowledge representation, artificial intelligence and automatic theorem proving, software specification and verification, etc.

在前人工作的基础上，对自动推理领域的如下问题进行了研究与探索：基于归结原理的多种类谓词演算、模糊逻辑与近似推理、Web环境下的知识表示与自动推理等。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。