Abstract
Given a mapping f: A → B from a preordered set A into an unstructured set B, we study the problem of defining a suitable preordering relation on B such that there exists a mapping g: B → A such that the pair (f,g) forms an adjunction between preordered sets. © 2014 Springer International Publishing.
Cite
CITATION STYLE
García-Pardo, F., Cabrera, I. P., Cordero, P., Ojeda-Aciego, M., & Rodríguez-Sanchez, F. J. (2014). On the existence of isotone Galois connections between preorders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8478 LNAI, pp. 67–79). Springer Verlag. https://doi.org/10.1007/978-3-319-07248-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
