否定命题

词组短语

negative proposition

与否定命题相关的网络例句 [注：此内容来源于网络，仅供参考]

In logic, affirmative comparative sentence is positive proposition,the negative is negative proposition.

从逻辑上讲，肯定比较句是正命题，否定比较句是负命题。

Declarative sentence or a combination increases the tone of voice of doubt the word "you","bar", etc., the general proposition of the whole of the doubt, the answer is a simple proposition for the whole of the positive and negative.

陈述句加疑问语调或兼用语气词"吗"、"吧"等构成，一般是对整个命题的疑问，回答也是对整个命题的简单的肯定和否定。

When these genera and their negations are combined together in every which way, and tested for consistency, it is found that only four species of causation remain conceivable.

当这些种类的命题和他们的否定命题以各式各样的形式联合在一起，并对其可靠性进行测试时，一般发现只有这四种因果关系或特殊的因果判断，是令人信服的。

Logic The positive or negative character of a proposition.

命题的性质：命题的肯定或否定的性质 adj。

Can All the Special Negative Proposition Not Be Transposed?

所有特称否定命题都不能换位吗？

To prove the inequality involving for negative proposition, the proposition "or at least",""," nonexistence "and" impossible "words, can consider to use when required.

凡涉及到的证明不等式为否定命题、惟一性命题或含有"至多"、"至少"、"不存在"、"不可能"等词语时，可以考虑用反证法。

Disjunction normal form theorem in the modal logic system S5 is inductively proved, which can be used for representing complex modal formulas by means of conjunction and disjunction of simplest modal formulas with depth at most 1 in the system S5. As application, it is proved that a knowledge base could answer KB-queries if and only if it could answer queries of non-modal propositions and their negations, which is a basic problem on knowledge base.

研究了模态逻辑系统S5中的析取范式定理的归纳证明，给出了在S5中用深度至多等于1的最简模态公式通过析取与合取运算表示含有多重模态词的公式的方法，作为范式定理的应用，讨论了知识库中的一个基本问题，证明了知识库能够回答KB命题式问题的充要条件是该知识库能够回答相关的非模态命题及其否定命题的问题。

Moreover, by discussing negation, universal quantifier, tense marker, adverb in proposition, in Chinese, Japanese, and English, I can clearly point out the communal structures of contrary negation and contradictory negation.

另外，藉著讨论国语、日语及英语的否定与全称数量词、时制辞、命题内副词等相互的关系，本人找出能明确分辨出中日英语中"相反否定"及"矛盾否定"的共通构造。

There were two experiments to investigate the Chinese negative declarative sentences and negative imperative sentences individua...

2实现对否定句的实际状态模拟是受到语用条件的限制的，否定并不是对否定辖域命题内容的反向推理。

Under the normal stress, logical negation is realized by negating the relation between predicates and arguments.

在自然重音的情况下，内部否定通过否定谓词和论元的关系达到否定命题的目的。

与否定命题相关的网络解释 [注：此内容来源于网络，仅供参考]

categorical proposition：直言命题

在这里,我们不想对于这些规则逐条细究,而只想指出,这些规则背后的基本理念是关于四种直言命题(categorical proposition)的理论. 直言命题,即以主谓形式构成的命题,一般来说分为四种:全称肯定命题、全称否定命题、特称肯定命题和特称否定命题. 此外,

Law of the Excluded Middle：排中律

以总共不到17页的三篇论文,一个年轻的荷兰数学家布饶儿 (Brouwer) 对以往古典逻辑的确实性提出挑战,特别是对所谓的排中律 (Law of the excluded middle),即对任一命题「A」,A或A之否定命题必有一为真,他认为我们不可无条件的接受,布饶儿坚持有其它的可能性,

negative part：负部

latticeve orthant 负象限 | negative part 负部 | negative proposition 否定命题

negative particular proposition：否定特称命题

negative part 负部分 | negative particular proposition 否定特称命题 | negative proposition 否定命题

negative proposition：否定命题

negative particular proposition 否定特称命题 | negative proposition 否定命题 | negative rotation 反时针方向旋转

universal negative proposition：全称否定命题

universal map 通用映射 | universal negative proposition 全称否定命题 | universal proposition 一般命题

negative rotation：反时针方向旋转

negative proposition 否定命题 | negative rotation 反时针方向旋转 | negative semidefinite 半负定的

negative real axis：负实轴

negative proposition 否定命题 | negative real axis 负实轴 | negative real number 负实

universal map：通用映射

universal function 通用函数 | universal map 通用映射 | universal negative proposition 全称否定命题

universal proposition：一般命题

universal negative proposition 全称否定命题 | universal proposition 一般命题 | universal quantifier 全称量词