| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 392553 | Information Sciences | 2014 | 15 Pages |
Abstract
Given a mapping f:A→B from a (pre-)ordered set A into an unstructured set B, we study the problem of defining a suitable (pre-)ordering relation on B such that there exists a mapping g:B→A such that the pair of mappings (f,g)(f,g) forms an adjunction between (pre-)ordered sets. The necessary and sufficient conditions obtained are then expressed in terms of closure operators and closure systems.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
F. García-Pardo, I.P. Cabrera, P. Cordero, M. Ojeda-Aciego, F.J. Rodríguez,