- 更多网络例句与格同态相关的网络例句 [注：此内容来源于网络，仅供参考]
-
This paper gives the definitions and some fundamental theorems on the completion and continuous mapping in the topological ∧ weak complete distributive lattice.
本文在作者的∧弱完全分配格的可备并同态扩张定理的基础上，给出了拓扑∧完全分配格的完备化与连续映象的定义与若干基本定理。
-
It is proved that each separated L-fuzzy locally convex topological vector space is linearly homeomorphic to a projective limit of a family of L-fuzzy normed spaces.
考察了格值模糊拓扑线性空间中归纳拓扑的若干性质，得到了由单一fuzzy线性序同态确定的归纳拓扑的远域基刻画。
-
And decompose the probability into the product of a fuzzy lattice homomorphism and a fuzzy lattice modular homomorphism.
并将概率分解成Fuzzy格同态与Fuzzy格模同态的乘积。
-
The concepts of prime ideal and primary ideal are proposed in residuated lattice impliction algebras.
在剩余格蕴涵代数中，提出了素理想和准素思想的概念，证明了包含核的理想的格蕴涵同态像仍是理想，并研究了准素理想与素理想的性质。
-
Subalgebra and homomorphism of completely distributive lattices and meet continuous lattices.
介绍了完全分配格、交连续格的商集、子代数、同态的概念。
-
This paper also gives a numeral model of LCS problem by using string-coding function, and proves that the LCS problem can be treated as so_called Tomograph problem and be solved with algorithms and hardware suitable for Tomograph problem.
本文提出与LCS问题和一阶Unification问题对应的两种格代数系统，并用项图描述Unification问题，从而构造得到这两种格代数系统之间的同态，使得用求解LCS的算法和硬件求解一类Unification问题成为可能，给出基于LCS硬件的Unification求解器的原理方案。
-
Secondly, in a more generalized framestructrue--lattice-ordered monoids,the notion of lattice-valued Mealy-type automata is introduced,we traverse some algebraic properties of this automata and investigate the congruences and homomorphisms of this type automata.Our main results indicate that the algebraic properties of lattice-valued Mealy-type automata have Close links to the algebraic properties of lattice-ordered monoids which automata take values in.Futhermore we study the minimization of lattice-valued Mealy-type automata and provide an algorithm to achieve the minimal lattice-valued Mealy-type automata within finite steps.
其次，在更一般的框架—格半群意义下，提出具有输入和输出字符的自动机——格值Mealy自动机的概念，从代数角度出发较详细地研究了此类自动机具有的性质，同时研究了此类自动机的同余和同态，揭示了此类自动机的代数性质和格半群的紧密联系，最终研究了格值Mealy自动机的极小化问题，并给出了在有限步可实现此极小化的算法。
-
We introduce and investigate lower homomorphisms and upper homomorphisms of generalized continuous lattices.
引进和研究了广义连续格的下同态和上同态，建立了广义代数格紧元素之间的映射扩充为下同态的充要条件
-
For formalized lattice implication algebra theoryT, it is proved thatTis preserved under submodels, unions of chains and homomorphisms;Tis neither complete nor model complete, and hence there exists no built-in Skolem function.
讨论有关格蕴涵代数结构的模型论性质，证明了形式化格蕴涵代数理论T保子模型、保模型链之并、保模型同态，理论T不是完备的、也不是模型完备的，因而不存在内在Skolem函数。
-
Furthermore we introduce the concepts of coverings and lattice-valued homomorphisms,we prove that the L-valued fuzzy transformation semigroups in which the multiplication is fuzzy transformation semigroup inducible is equivelent to usual faithful transformation semigroups in the sence of lattice-valued strong homomorphism.
若格半群中的乘法是格值变换半群可诱导的，在格值强同态下证明了格值可诱导变换半群和一般有效变换半群是等价的。
- 更多网络解释与格同态相关的网络解释 [注：此内容来源于网络，仅供参考]
-
Burg deconvolution：伯格反褶积
预测反褶积 predictive deconvolution | 伯格反褶积 Burg deconvolution | 同态反褶积 homomorphic deconvolution
-
latticehomomorphism：格同态
lattice theory 格论 | latticehomomorphism 格同态 | latus rectum 通径
-
latus rectum：通径
latticehomomorphism 格同态 | latus rectum 通径 | laue's equations 劳卮方程