查询词典 propositional function

A formula of propositional logic is said to be satisfiable if logical values can be assigned to its variables in a way that makes the formula true.

公式命题逻辑被认为是符合要求，如果逻辑值可分配给它的变量的方式，使真正的公式。

On the basis of the analysis, the paper proposes a 3-level semantic-pragmatic system for the UFP: Level 1--- Core Properties:[1] Necessity to Look Back for Contrast and [2] Demand for Continuation; Level 2--- Functions:"Primary"--- [3] Interrogation, [4] Reminding, and [5] Topic Marking "Secondary"---[6] Truncated Question and [7] Intense Inquiry Level 3---Interpretations:(through propositional content and context) [8] Idea Development, [9] Puzzlement, [10] Unchanged State, [11] Uncertainty, [12] Inconclusiveness, etc.

准此，本文为"呢"建构出一个包含3个层面的语义-语用架构如下：第一层面基本特征：[1] 在先前的语境中寻求对比，[2] 要求继续对话；第二层面延伸功能："主要功能"：[3] 疑问语气，[4] 提醒，[5] 话题标记"次要功能"，[6] 省略问句，[7] 深究；第三层面情景解释：[8] 意念扩展，[9] 疑惑不解，[10] 未变状态，[11] 不能确定，[12]悬疑不决，等等。

By means of infinite product of evenly distributed probability spaces,the concept of truth degrees of propositions in 3-valued logic systems W_3,G_3,Π_3 and S_3 are introduced,and some properties of distribution of propositional truth degree and certain inference rules are obtained.

利用势为3的均匀概率空间的无穷乘积在W3、G3、Π3及S3系统中引入了公式的真度概念，得到了命题真度分布的一些性质，同时给出了三值真度推理规则。

The rules of modus ponens are given and the main results of propositional calculus in two-valued logic.

本文利用有补T-范建立了一类Fuzzy命题演算系统，给出了假言推理规则，推广了二值逻辑中命题演算的主要结果，且演算简单方便。

Elementary logic and Algebra Propositional calculus, quantifiers.

初等逻辑和代数命题演算，量词。

The resource model of design knowledge representation is proposed based on propositional logic and Cartesion product.

这一模型概括了产品开发中所涉及的各种资源，是对现有知识表示技术的补充。

The concept of relative Γ-tautology degree of formulas in four important propositional logics, Lukasiewicz logic, L(superscript *) logic, Gdel logic and product logic, has been proposed, and basic properties of it are obtained.

基于广义重言式理论，在四种重要的命题逻辑系统Lukasiewicz系统，L系统，Gdel系统和Ⅱ系统中，引入了公式的相对Γ-重言度概念，给出了相对Γ-重言度的若干性质。

At that level we stand to secure an apriori grasp of the primary ampliative move, a move that the material implication at the propositional level merely shadows.

在这个水平上，我们坚持维护对首要的扩展推进进行先天把握，这个推进的实质蕴涵，在命题水平被遮蔽。

We study the properties of $BR_0$-algebra and the total complication triple I method on complete $BR_0$-algebra, and we apply the results to $R_0$-Unite interval $\overline{W}$. Not only we have simplified the proof of the results of $R_0$-type triple I method on $R_0$-Unite interval $\overline{W}$, but also we make the proof to combine with the formal deductive system for fuzzy propositional calculus. This work also explains that the $R_0$-type triple I method is a matching fuzzy inference with $B{\cal L}^*$ system.

研究了基础$BR_0$-代数的性质和基于完备基础$BR_0$-代数的全蕴涵三I算法，对一般蕴涵算子给出了三I算法解存在的一个充分条件，并将结果应用于$R_0$-单位区间$\overline{W}$，不但极大的简化了$R_0$-单位区间$\overline{W}$的$R_0$-型$\alpha$-三I算法结果的证明，而且使其证明过程与相应的模糊命题演算系统结合起来，说明了$R_0$-型三I算法是与$B{\cal L}^*$系统相匹配的模糊推理方法。

My thesis built the theory of predicate logic on the basis of L* propositional logic.

本文在命题逻辑的基础上以系统为背景建立谓词逻辑理论。

I can do simple painting, carpentry and plumbing.

我能做简单的油漆、木工和修水管等工作。

The motivations, notations and outline of this work are also given in this chapter.

从这个意义上讲，这些时滞是无害的。然后用实例说明这三个定理的应用和互不包含性。