On the definition of suitable orderings to generate adjunctions over an unstructured codomain

DOI10.1016/j.ins.2014.07.006zbMath1355.06011OpenAlexW2087657125MaRDI QIDQ508629

F. García-Pardo, Francisco J. Rodríguez, Pablo Cordero, Inma P. Cabrera, Manuel Ojeda Aciego

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.07.006

zbMATH Keywords

adjunctionisotone Galois connectionpartial order relationpreorder relation

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (8)

Relational Galois connections between transitive digraphs: characterization and construction ⋮ On the construction of adjunctions between a fuzzy preposet and an unstructured set ⋮ Representation of fuzzy subsets by Galois connections ⋮ On stability of fuzzy formal concepts over randomized one-sided formal context ⋮ Implication operators generating pairs of weak negations and their algebraic structure ⋮ On Fuzzy Generalizations of Concept Lattices ⋮ On Closure Systems and Adjunctions Between Fuzzy Preordered Sets ⋮ Randomized Fuzzy Formal Contexts and Relevance of One-Sided Concepts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triadic fuzzy Galois connections as ordinary connections
• Kernel systems on \(L\)-ordered sets
• Multi-adjoint property-oriented and object-oriented concept lattices
• Multi-adjoint relation equations: definition, properties and solutions using concept lattices
• Isotone fuzzy Galois connections with hedges
• Extending conceptualisation modes for generalised formal concept analysis
• Fuzzy Galois connections under weak conditions
• A coalgebraic approach to non-determinism: applications to multilattices
• Concept lattices of isotone vs. antitone Galois connections in graded setting: mutual reducibility revisited
• On equivalence of conceptual scaling and generalized one-sided concept lattices
• Formal concept analysis via multi-adjoint concept lattices
• Possibility theory and formal concept analysis: characterizing independent sub-contexts
• Join-completions of \(L\)-ordered sets
• Multimodal linguistic inference
• Programming from Galois connections
• A general Galois theory for operations and relations in arbitrary categories
• Finitary coalgebraic multisemilattices and multilattices.
• On heterogeneous formal contexts
• Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
• Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
• Logics from Galois connections
• Abstract interpretation and types for systems biology
• Fuzzy closure systems onL-ordered sets
• Intuitionistic propositional logic with Galois connections
• An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
• Adjoint Functors
• Fuzzy Galois Connections
• Concept-Forming Operators on Multilattices
• Fitting Pattern Structures to Knowledge Discovery in Big Data
• Galois Connexions

This page was built for publication: On the definition of suitable orderings to generate adjunctions over an unstructured codomain