Results 131 to 140 of about 343 (169)
Some of the next articles are maybe not open access.
Hilbert Algebras with Hilbert–Galois Connections
Studia Logica, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio A. Celani, Daniela Montangie
openaire +2 more sources
Fuzzy Galois connections categorically
MLQ, 2010The paper deals with closed categories over complete lattice-ordered monoids \((L, \vee, \wedge, \ast, 1)\). Covariant and contravariant fuzzy Galois connections were introduced and examined by \textit{R. Bělohlávek} [Math. Log. Q. 45, No.~4, 497--504 (1999; Zbl 0938.03079)], and \textit{G. Georgescu} and \textit{A. Popescu} [Soft Comput. 7, No.~7, 458-
Javier Gutiérrez García +3 more
openaire +2 more sources
Relational fuzzy Galois connections
2017 Joint 17th World Congress of International Fuzzy Systems Association and 9th International Conference on Soft Computing and Intelligent Systems (IFSA-SCIS), 2017We propose a suitable generalization of the notion of Galois connection whose components are fuzzy relations. We prove that the construction embeds Yao's notion of fuzzy Galois connection as a particular case. Although the natural framework for the proposed notion is that of fuzzy preposets, we also prove that it behaves properly with respect to the ...
Inma P. Cabrera +2 more
openaire +1 more source
2007
Galois connections can be defined for lattices and for ordered sets. We discuss a rather wide generalisation, which was introduced by Weiqun Xia and has been reinvented under different names: Relational Galois connections between relations. It turns out that the generalised notion is of importance for the original one and can be utilised, e.g., for ...
openaire +1 more source
Galois connections can be defined for lattices and for ordered sets. We discuss a rather wide generalisation, which was introduced by Weiqun Xia and has been reinvented under different names: Relational Galois connections between relations. It turns out that the generalised notion is of importance for the original one and can be utilised, e.g., for ...
openaire +1 more source
Armstrong systems and Galois connections
2011 IEEE International Conference on Granular Computing, 2011In the paper [1], it is proved that any Galois connection (f, g) on a complete lattice made an Armstrong system F (f, g) . We prove in this short note that the converse holds, that is, for a given Armstrong system R, we can make a Galois connection (φ R , ψ R ) and the original Armstrong system R is identical with the induced Armstrong system F (φR, ψR)
Michiro Kondo, Sho Soneda, Bunpei Yoshii
openaire +1 more source
Galois Connections for Flow Algebras
2011We generalise Galois connections from complete lattices to flow algebras. Flow algebras are algebraic structures that are less restrictive than idempotent semirings in that they replace distributivity with monotonicity and dispense with the annihilation property; therefore they are closer to the approach taken by Monotone Frameworks and other classical
Piotr Filipiuk +3 more
openaire +1 more source
Logical Relations and Galois Connections
2002Algebraic properties of logical relations on partially ordered sets are studied. It is shown how to construct a logical relation that extends a collection of base Galois connections to a Galois connection of arbitrary higher-order type. "Theorems-for-free" is used to show that the construction ensures safe abstract interpretation of parametrically ...
Kevin Backhouse, Roland Carl Backhouse
openaire +1 more source
Triadic fuzzy Galois connections as ordinary connections
Fuzzy Sets and Systems, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Radim Belohlávek, Petr Osicka
openaire +2 more sources
Biclosed Binary Relations and Galois Connections
Order, 2001A biclosed relation between two closure spaces \(E\) and \(E'\) is a binary relation \(R\subseteq E\times E'\) with every row of its matrix representation corresponding to a closed subset of \(E'\) and every column corresponding to a closed subset of \(E\).
Florent Domenach, Bruno Leclerc
openaire +1 more source
On Galois Connections and Soft Computing
2013After recalling the different interpretations usually assigned to the term Galois connection, both in the crisp and in the fuzzy case, we survey on several of their applications in Computer Science and specifically, in Soft Computing.
Francisca García-Pardo +3 more
openaire +1 more source