细半模格的循环同余与某些有限结构的非有限公理化
Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures
摘要:
给出了有限二部图不能用有限图中的许多一阶句公理化的新证明。(This事实是由L证明的一般定理的推论。Ham和M. Jackson,而对于ALL图类中的所有二部图,这一事实的对应是紧性定理的一个众所周知的推论。)同时,为了证明我们的方法在数学的各个领域都是适用的,我们证明了有限单群和窄半模格的并不可约同余的有序集都不能用有限结构类中的许多公理来描述.自2007年G. Grätzer和E.克纳普,超薄半模格构成了最深入的研究部分格理论,他们已经导致的结果,甚至在群论和几何。除了上述的非公理化结果外,我们还给出了窄半模格的同余格的一个新性质,称为可分解循环元性质。
英文摘要:
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of ALL graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups, nor the ordered sets of join-irreducible congruences of slim semimodular lattices can be described by finitely many axioms in the class of FINITE structures. Since a 2007 result of G. Grätzer and E. Knapp, slim semimodular lattices have constituted the most intensively studied part of lattice theory and they have already led to results even in group theory and geometry. In addition to the non-axiomatizability results mentioned above, we present a new property, called Decomposable Cyclic Elements Property, of the congruence lattices of slim semimodular lattices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。