| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 395229 | Information Sciences | 2010 | 13 Pages |
Abstract
A mapping f:P→Qf:P→Q between posets P and Q is called weakly cut-stable if f can be naturally extended to a weakly complete lattice homomorphism (i.e., preserving non-empty meets and joins) f∗:N(P)→N(Q)f∗:N(P)→N(Q) between the corresponding Dedekind–MacNeille completions. These mappings are studied and described by the 1st-order language.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Radomír Halaš, Judita Lihová,