代入规则

词组短语

rule of substitution · substitution rule

与代入规则相关的网络例句 [注：此内容来源于网络，仅供参考]

Topics covered include: programming and computability theory based on a term-rewriting,"substitution" model of computation by Scheme programs with side-effects; computation as algebraic manipulation: Scheme evaluation as algebraic manipulation and term rewriting theory; paradoxes from self-application and introduction to formal programming semantics; undecidability of the Halting Problem for Scheme; properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences; logic for program specification and verification; and Hilbert's Tenth Problem.

其所包含的主题：程序和运算理论是基于根据算数和具有一些副作用的计划纲要的条款重写和"代入"模式之上的、关于代数学计算的算数：关于代数学计算和术语重写理论的评价方案作计划、应用程序自己和说明的自相矛盾到形式上的程序语义、关于计划Halting 问题的不可判定性、可递归可列举集合的属性、导致对于等同计划的不完整规则、对于逻辑和证明程序的规范和Hilbert的第十问题。

Analysis for testability is widely used in DFT and test pattern generation, but most testability analysis algorithms have the shortcoming of either inaccuracy or being too complicated. A new method to calculate the signal probabilities of the nodes in IC is pre-sented in Chapter 7 of this dissertation. The signal probabilities by our method is more exact than by the previous ones. A symbol of the signal probability at the fan-out node is created and is propagated to the RFON (Reconvergent Fan-out Nodes). At the RFON, the expression containing the symbol is simplified using the rule which corresponds to the law of identity in Boolean algebra. After the expression is simplified, the symbol is substituted with its numeric value. Theoretical analysis shows that this method is concise and has a low computing complexity.

可测试性分析在可测试性设计和测试生成中都有着广泛的应用，然而大部分的可测性分析方法都存在不精确或者过于复杂的毛病，在第七章中作者提出了一种新的计算IC电路节点的信号概率值的符号算法，该算法得出的信号概率值比用以往的算法法得出的要更准确，也更简洁，针对电路中的扇出节点重汇聚现象，我们在每一个扇出节点定义了一个信号概率的符号，在以后的计算中一直使用该符号参与计算，直到该符号传播至重汇聚处，利用一定的规则把含符号的表达式化简，再将符号的真实值代入，在计算符号概率的过程中定义了一个和布尔代数中的同一律相对应的运算规则，通过该运算规则，使得信号概率的结果更加准确，符号算法具有简洁方便，计算复杂度小的特点 4。

Syntactical completeness is only concerned with syntactics. The classical proposition logic systems with the rule of substitution are syntactical complete, while the ones without the rule are not.

语法完全性仅与一个形式系统的语法构造相关，经典命题逻辑的有代入规则的系统是语法完全的，无代入规则的系统不是语法完全的。

Syntactical completeness is only concerned with syntactics. The classical preposition logic systems with the rule of substitution are syntactically complete, while the ones without the rule are not.

语法完全性仅与一个形式系统的语法构造相关，经典命题逻辑的有代入规则的系统是语法完全的，无代入规则的系统不是语法完全的。

与代入规则相关的网络解释 [注：此内容来源于网络，仅供参考]

rule of signs：正负号规则

rule of rounding 舍入规则 | rule of signs 正负号规则 | rule of substitution 代入规则

rule of substitution：代入规则

rule of signs 正负号规则 | rule of substitution 代入规则 | rule of syllogism 三段论法规则

rule of syllogism：三段论法规则

rule of substitution 代入规则 | rule of syllogism 三段论法规则 | rule of three 三分律

substitution group：置换群

代换;代入 substitution | 置换群 substitution group | 代换规则 substitution rule