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函数。
Obviously, all 1-stars are Skolem graceful.
很显然，1-星图是Skolem优美图。
In 1927, Skolem obtained the famous Skolem-Noether theory:the automorphisms of the n × n matrix algebra over a field are inner.
早在1927年，Skolem就获得了著名的Skolem-Noether定理：域上的矩阵代数的自同构皆为内自同构。
The Skolem graceful labelings have been invented analogues of graceful graphs by modifying the permissible vertex labels.
Skolem优美标号是优美标号的一个衍变，κ-星图是由κ个任意大小的星图组成的不连通图。
In this paper, combining the computer constructive prove with mathe- matical prove, three classes of graph labelings: skolem graceful labeling, magic labeling and harmonious labeling are researched, some problems and conjectures have been solved respectively.
本文对图的Skolem优美标号、超幻和标号和调和标号三类问题进行研究，分别解决了这三类标号中的一些问题和猜想，取得了较好的结果。
Choudum and Kishore proved that all 5-stars are Skolem graceful. In this thesis, we prove that all K-stars are Skolem graceful.
Figueroa-Centeno等证明了当n为奇数且n≠5(mod 8)时，Book图B_n真不是超边幻和图，并猜想对n≥5，当且仅当n是偶数或n≡5(mod 8)时，B_n是超边幻和图。
The extended algorithm incorporates a concept of inferred constraints within XML mapping rules and seeks any implicit assumptions with non-Skolem functions to substitute Skolem terms within the built-in predicates after translation phase.
通过引入映射规则中的约束条件，消除阻碍重写的Skolem函数，从而解决内定谓词问题，增大原算法的应用范围。
As two examples, we present the Skolem standard form theorem and the Herbrand theorem of ME.
作为两个实例，本文给出了ME~上的Skolem范式定理及Herbrand定理。
According to Skolem theorem, there exist several modes of semantic explanation for any formal system.
斯科伦定理指出，任意一个形式系统，都存在可数多个语义解释方式。
Since this kind of describing forms of decision can be easily transformed into the Skolem's standard form, they can be applied directly to resolution inference in artificial intelligence field.
这种决策描述形式易于转化为Skolem标准型，可以直接应用于人工智能的归结推理。
Skolem's p-adic method, which is used in attacking certain Diophantine equations, is another powerful application of p-adic numbers.
另一个主要方面是Skolem的p-adic方法，主要应用于攻克某些特定的丢番图方程。