Results 121 to 130 of about 248 (160)

Fuzzy Galois connections categorically

Mathematical Logic Quarterly, 2010
The 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 Gutierrez Garcia, Dexue Zhang
exaly   +3 more sources

A Primer on Galois Connections

Annals of the New York Academy of Sciences, 1993
ABSTRACT. The rudiments of the theory of Galois connections (or residuation theory, as it is sometimes called) are provided, together with many examples and applications. Galois connections occur in profusion and are well known to most mathematicians who deal with order theory; they seem to be less known to topologists.
M. ERNÉ, J. KOSLOWSKI, A. MELTON, G. E. STRECKER   +3 more
exaly   +2 more sources

Galois Connection for Hyperclones

2010 40th IEEE International Symposium on Multiple-Valued Logic, 2010
This paper is inspired by the paper of Tarasov in which he investigates maximal partial clones on a two-element set. It happens that the approach of Tarasov can be translated into the language of hyperclone theory. He introduced a notion of quasicomposition which assigns to extended hyperoperations extension of their composition.
Hajime Machida, Jovanka Pantovic, Ivo G. Rosenberg   +2 more
openaire   +1 more source

Duality for Quasilattices and Galois Connections

Fundamenta Informaticae, 2017
The 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   +2 more sources

A category of Galois connections

1987
We study Galois connections by examining the properties of three categories. The objects in each category are Galois connections. The categories differ in their hom-sets; in the most general category the morphisms are pairs of functions which commute with the maps of the domain and codomain Galois connections. One of our main results is that one of the
J. M. McDill, Austin Melton, George E. Strecker   +2 more
openaire   +1 more source

A Galois Connection

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

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), 2017
We 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, Pablo Cordero, Manuel Ojeda-Aciego   +2 more
openaire   +1 more source

Armstrong systems and Galois connections

2011 IEEE International Conference on Granular Computing, 2011
In 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

Relational Galois Connections

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 for Flow Algebras

2011
We 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, Michal Terepeta, Hanne Riis Nielson, Flemming Nielson   +3 more
openaire   +1 more source