可判定性

OWL DL '' supports those users who want the maximum expressiveness while retaining computational completeness (all conclusions are guaranteed to be computable) and decidability (all computations will finish in finite time).

OWL DL 支持那些需要最强表达能力的推理系统的用户，且这个推理系统能够保证计算的完全性（computational completeness，即所有的结论都能够保证被计算出来）和可判定性（decidability，即所有的计算都在有限的时间内完成）。

Based on the two normal forms, the decidability theorem in L is then proved and a deduction-based decision algorithm P is designed. The time complexity O(n3) of P is much less than the complexity O(2n) of the true value table method and the complexity O(n5) of HAL based on the tactic scheme.

首先定义了消解复杂性的两种范式：最简范式和文字范式，在此基础上采用演绎方法证明了L中的可判定性定理，并设计了命题公式的演绎判定算法P。P的时间复杂度为O(n^3)，远远小于基于真值表法的O(2^n)和基于策略方案HAL的O(n^5)。

OWL DL supports those users who want the maximum expressiveness without losing computational completeness (all entailments are guaranteed to be computed) and decidability (all computations will finish in finite time) of reasoning systems.

OWL DL 支持那些需要最强表达能力的推理系统的用户，且这个推理系统能够保证计算的完全性（computational completeness，即所有的结论都能够保证被计算出来）和可判定性（decidability，即所有的计算都在有限的时间内完成）。

The study of lattice-valued propositional logic system based on lattice implication algebra.On the bases of previous study, by using the concepts and methods of T algebras we established the lattice-valued propositional logic system LP , whose truth values domain is a lattice implication algebra, and discussed systematically the semantical and syntactical properties of LP , proved the soundness theorem 、consistency theorem、deduction theorem and the decidability of validity of the system when the truth values lattice is finite. We also discussed the relationship between the α-theorem of some premise, say A, and the closed sets that contain A.

本文在前人研究工作的基础上，利用T代数的概念与方法，建立了真值取于格蕴涵代数的格值命题逻辑系统LP，对它的语义及语法性质进行了较系统的研究，得到了它的可靠性定理、协调性定理及演绎定理等，证明了值格有限时系统"有效性"的可判定性并讨论了某一前提A下的α定理与包含A的闭集之间的关系。

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的第十问题。

In this paper, a new method used to deal with the motion ability is studied deeply based on Routh-Hurwitz Criterion. The advantage of this kind of analysis method consists in the fact that after establishing the equation in differential calculus for the motion system, there is no need to know a root of the equation, if you know the root signs, you can judge the zero solution stability of the system.

本文利用劳斯－赫尔维茨判据(Routh-Hurwitz Criterion)对机械系统中离心转速调节器的运动德定性进行了分析，这种分析方法的优点就在于：建立系统运动微分方程的特征方程后，不必求解特征方程的根，只需知道根的符号就可判断系统的零解稳定性。

In this paper,the system is specified in EFSM model.The concept of invertibility is introduced and used to optimize the transition executability analysis method,so that shorter test sequences can be generated and smaller space is needed to generate the TEA tree.

文中以EFSM为协议的描述模型，引入了逆向判定性的概念，并利用这一概念对转换可执行性分析方法进行了改进，缩短了生成的测试序列的长度，并且减小了所需的TEA树扩展空间。

Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.

课程项目包含：有限状态机与正规语言，情境无关语言，Turing机，部分递回函数，Church理论，不可判定性，可简化性与完整性，时间复杂度与NP-完整性，或然率计算，与交互验证系统。译注：Turing machine 一般译作"图灵机"或"图林机"，本课程依据专有名词保留原则，一律译为Turing机。

The limitations of finite-memory programs, closure properties for simplifying the job of writing finite-memory programs, and decidable properties of such programs are also studied.

有限记忆程序的局限、简化编写有限记忆程序的闭包性质和有限记忆程序的可判定性在本章也被探讨。

Further more, the simplified analysis method on stressed-skin effect of corrugated steel sheet is also discussed in detail.

此外还比较详细地探讨了蒙皮效应的简化分析方法。

If I had known her telephone number,I would have called her.

要是我知道她的电话号码，我就打电话给她了。