查询词典 convolution theorem

Erent. In this chapter, under theenvironment of complete lattice, it gives some new solving methods of the threepublic problems. The tool is the representation theorem which based on union-intersection-preserving mapping and intersection-union-preserving mapping.

本章在值格仅为完备格环境下，给出了这些公开问题的新解决办法，主要工具是基于保并交映射和交并映射的模糊集表现定理。

Whereas, what worth to say is thatthe representation theorem in most of literatures is obtained by strengthen thecondition of the membership degree's lattice. Such as it needs the membershipdegree's lattice was dense complete lattice, completely distribute lattice or unitinterval, ect.

但是，值得指出的是，多数文献中的表现定理是对模糊集的值格加强限制条件下得到的，例如有些文献要求值格为稠密完备格、完全分配格或者实单位区间等等。

A Ky Fan matching theorem for transfer compactly open covers in complete L-convex metric space s is established.

在完备L-凸度量空间中建立了一个转移紧开覆盖的Ky Fan匹配定理。

Does research in a common fixed point theorem of fuzzy mapping s in inequality conditions and the cut set is the nonempty closed bounded subsets of,while is complete metric space.

2，研究了在完备度量空间中一对模糊映象满足一些特定不等式条件，以及当其截集是中非空有界闭集时，该对模糊映象的公共不动点的存在性问题。

The completeness theorem of this method were proved at last.

最后， 证明了该方法的完备性。

At last, we give two simplified proof for the necessary lemma in order to prove the completeness theorem of PI resolving.

第二部分：基于均匀概率的思想，给出了Godel和Kleene三值命题逻辑系统中公式的真度理论。

The details of proving the completeness theorem of formula system L~*, which is given by Prof. Wang, are reviewed, and the proving of strong completeness about L~* is analyzed and revised.

考察了形式系统*完备性的现有证明过程，并对其中所涉及的R0代数同构问题进行了研究，分析了关于*系统强完备性证明中的错误并给出了一个全新的修正证明。

Completeness Theorem showsthat syntactic and semantic consequences coincide in the case of the predicatelogic.

完全性定理表明一阶谓词逻辑的语法后承和语义后承是重合的，它标志着一阶逻辑的成熟。

Because Horn-clause logic theory is of significance in both respects of theory and application, We especially studied lattice-valued Horn-clause logic with truth-value in lattice implication algebra, and the soundness and completeness theorem have been proved.

经典逻辑中，Horn子句逻辑理论具有广泛的应用，因而，本文中特别建立了基于格蕴涵代数的格值-类Horn子句逻辑，并证明了可靠性和完备性定理，这为建立一类基于格值逻辑这种非经典逻辑的人工智能语言将产生重要的作用。

Compared with Plotkin's work, a reduction closed CPS language is defined in which all continuations are explicitly expressed as functional encodings and it is simpler to prove both the soundness and completeness directions of simulation theorem.

与Plotkin的工作比较，工作特点在于，给出了一个CPS归约闭语言，该语言中所有继续都可以用函数形式表达，且模拟定理的可靠性和完备性方向证明更为简单。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。