查询词典 Boolean

The course contains four sections as follows: mathematical logic (including basic concepts of propositional logic and predicate logic, propositional calculuses and inference theories), set theory (including set algebras, relations, functions and cardinal numbers), algebraic structure (including algebraic systems, semigroups and groups, rings and fields, lattices and Boolean algebras), graph theory (including basic concepts of graph, Euler graphs and Hamiltonian graphs, trees, planar graphs and coloring graphs, some special vertex subsets and edge subsets).

本课程包含四部分内容：数理逻辑（包含命题逻辑与一阶逻辑的基本概念、等值演算以及推理理论），集合论（包含集合代数、二元关系、函数和基数），代数结构（包含代数系统、半群与群、环与域、格与布尔代数），图论（包含图的基本概念、欧拉图与哈密顿图、树、平面图及图的着色、图的某些特殊的顶点子集与边子集）。

FILE.closed Return a Boolean value indicating whether the file has been closed.

返回布尔值指示该文件是否已经关闭。

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

This curriculum mainly narrated the VHDL complete characteristic, also has contained the related number system design knowledge, the content including the electronic design automation tool's use, CMOS and the programmable logical craft, the Boolean algebra and the combinatory logic design basic principle

本课程主要讲述了VHDL的全部特征，也包含了有关数字系统设计的知识，内容包括电子设计自动化工具的使用，CMOS和可编程逻辑工艺、布尔代数和组合逻辑设计的基本原则，各种建模的技术，有限状态机的设计，以及三个重要的可测试设计；扫描路径、内置自检和边界扫描等。

However, these methods can return any value, so if the comparison operator is used in a Boolean context (e.g., in the condition of an if statement), Python will call bool on the value to determine if the result is true or false.

但是这些方法也可以返回任何值，所以如果比较运算发生在布尔上下文中（例如 if 语句中的条件测试），Python会在返回值上调用函数 bool 确定返回值的真值。

Chapter one: Provide the simple introduction to basic conceptions and properties used in the article about MTL-algebra; prove the set of all the filters form a complete distribution lattice in MTL-algebra; Discussion some property characteristics of Boolean filter, at the same time introduce the conceptions of positive implicative filter and obstinate filter, receive some properties of them, discuss the relation between the important filters and their equivalent condition.

第一章：对文章中用到的关于MTL-代数的基本概念和性质给出简单的介绍，证明了MTL代数中的全体滤子之集构成一个完备的分配格；讨论了布尔滤子的一些性质特征，同时引入和固执滤子的概念，得到它们的一些性质，探讨了几类重要滤子之间的关系。

Zadeh put forward, make MTL-algebra"s filter conception fuzzified, provide the conceptions and properties of fuzzy filter, obtain the structure of all fuzzy, filters, prove that the set of all fuzzy filters forms a complete distribution lattice; Provide several fuzzy Boolean filter"s equivalent forms, introduce fuzzy positive implicative filter, fuzzy obstinate filter and fuzzy ultra filter, discuss some property characteristics and terms that transform each other under certain terms to obtain them.

Zadeh提出的模糊集思想使MTL-代数的滤子概念模糊化，给出了Fuzzy滤子的概念和性质，得到了全体Fuzzy滤子的结构，证明了全体Fuzzy滤子之集构成完备的分配格；给出了Fuzzy布尔滤子的若干等价形式，并且引入了Fuzzy正蕴涵滤子，Fuzzy固执滤子和Fuzzy超滤的概念，得出了它们的一些性质特征以及在一定条件下之间相互转化的条件。

Graph theory and topology was researched to establish graphic interpreter, boolean multiplication ⊙ of a matrix is inferred and defined, and simple sub-graphs are disconnected from complex graph by the multiplication ⊙; parameterization of graph is realized through a sequence of sub-graph entities linked by constraints.

研究了图形翻译器的图论和拓扑学理论基础，推出并定义了矩阵布尔乘运算〓，使用矩阵运算〓将复杂的图形拆分成一系列简单子图；以约束关联的子图实体序列实现图形的参数化。

The value of a conditional expression is defined as follows: If the effective boolean value of the test expression is true, the value of the then-expression is returned.

一个条件表达式的值定义如下：如果测试表达式的有效布尔值为true，则返回then表达式的值。

The suite of the if clause, expr_true_suite, will be executed only if the above conditional expression results in a Boolean true value.

74用于判断结果真假的条件表达式，以及当表达式为真或者非零时执行的代码块。

Diabetes is a social disease that affects several million people worldwide.

糖尿病是一个社会性疾病，全世界有数百万人罹患此病。

I'll call you on Friday to see if we can reschedule our luncheon meeting at your convenience.

我星期五会给您打电话在您方便的时候我们重新安排我们的午餐约会。