weakly atomic
Recently Published Documents


TOTAL DOCUMENTS

5
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2008 ◽  
Vol 43 (5) ◽  
pp. 15-26 ◽  
Author(s):  
Vijay Menon ◽  
Steven Balensiefer ◽  
Tatiana Shpeisman ◽  
Ali-Reza Adl-Tabatabai ◽  
Richard L. Hudson ◽  
...  
Keyword(s):  

1992 ◽  
Vol 44 (2) ◽  
pp. 252-269 ◽  
Author(s):  
Alan Day

AbstractThis paper examines the simultaneous doubling of multiple intervals of a lattice in great detail. In the case of a finite set of W-failure intervals, it is shown that there in a unique smallest lattice mapping homomorphically onto the original lattice, in which the set of W-failures is removed. A nice description of this new lattice is given. This technique is used to show that every lattice that is a bounded homomorphic image of a free lattice has a projective cover. It is also used to give a sufficient condition for a fintely presented lattice to be weakly atomic and shows that the problem of which finitely presented lattices are finite is closely related to the problem of characterizing those finite lattices with a finite W-cover.


1990 ◽  
Vol 42 (2) ◽  
pp. 365-382 ◽  
Author(s):  
Keith A. Kearnes

There is a body of results for lattices known as “Decomposition Theory” which is aimed at proving certain existence and uniqueness theorems concerning irredundant representations of elements of a compactly generated lattice. The motivation for these results is certainly the quest for sufficient conditions on congruence lattices to insure irredundant subdirect representations of algebras. These theorems usually include some kind of modularity or distribut i v e hypothesis (for uniqueness) and some atomicity hypothesis (for existence); the precise details can be found in [3]. The atomicity condition is usually the hypothesis that the lattice in question is strongly atomic or at least atomic. Now, it is well-known that every algebra has a weakly atomic congruence lattice.


1984 ◽  
Vol 23 (3) ◽  
pp. 233-237
Author(s):  
S. A. Chikhachëv
Keyword(s):  

1971 ◽  
Vol 36 (1) ◽  
pp. 129-140 ◽  
Author(s):  
G. Fuhrken ◽  
W. Taylor

A relational structure is called weakly atomic-compact if and only if every set Σ of atomic formulas (taken from the first-order language of the similarity type of augmented by a possibly uncountable set of additional variables as “unknowns”) is satisfiable in whenever every finite subset of Σ is so satisfiable. This notion (as well as some related ones which will be mentioned in §4) was introduced by J. Mycielski as a generalization to model theory of I. Kaplansky's notion of an algebraically compact Abelian group (cf. [5], [7], [1], [8]).


Sign in / Sign up

Export Citation Format

Share Document