Results 161 to 170 of about 686,932 (192)
Some of the next articles are maybe not open access.
Duality for Quasilattices and Galois Connections
Fundamenta Informaticae, 2017The primary goal of the paper is to establish a duality for quasilattices. The main ingredients are duality for semilattices and their representations, the structural analysis of quasilattices as Płonka sums of lattices, and the duality for lattices developed by Hartonas and Dunn.
Anna B. Romanowska, Jonathan D. H. Smith
openaire +3 more sources
Logica Universalis, 2007
The connection presented in this paper mirror-links two metamathematical structures, the finitary closure operators, and the compact consistency properties, in such a way that a specification of one structure induces a provably equivalent specification of the other.
openaire +1 more source
The connection presented in this paper mirror-links two metamathematical structures, the finitary closure operators, and the compact consistency properties, in such a way that a specification of one structure induces a provably equivalent specification of the other.
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
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +3 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 +2 more sources
Galois Connections and Pair Algebras
Canadian Journal of Mathematics, 1969Unless further restricted, P, Q, and R denote arbitrary partially ordered sets whose order relations are all written “≦” .An isotone mapping ϕ: P → Q is said to be residuated if there is an isotone mapping ψ: Q → P such that(RM 1) xϕψ ≧ x for all x i n P;(RM 2) yψϕ ≦ for all y in Q.Let Q* denote the partially ordered set with order relation dual to ...
openaire +2 more sources
A Diagram of Galois Connections of Functorial Topologies
Applied Categorical Structures, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gabriele Castellini, Stan Dziobiak
openaire +2 more sources