منابع مشابه
Programming from Galois Connections
Problem statements often resort to superlatives such as in eg. “. . . the smallest such number”, “. . . the best approximation”, “. . . the longest such list” which lead to specifications made of two parts: one defining a broad class of solutions (the easy part) and the other requesting the optimal such solution (the hard part). This paper introduces a binary relational combinator which mirrors...
متن کاملCharacterizing intermediate tense logics in terms of Galois connections
We propose a uniform way of defining for every logic L intermediate between intuitionistic and classical logics, the corresponding intermediate tense logic LKt. This is done by building the fusion of two copies of intermediate logic with a Galois connection LGC, and then interlinking their operators by two Fischer Servi axioms. The resulting system is called L2GC+FS. In the cases of intuitionis...
متن کاملProgramming from Galois Connections — Principles and Applications
Problem statements often resort to superlatives such as in eg. “. . . the smallest such number”, “. . . the best approximation”, “. . . the longest such list” which lead to specifications made of two parts: one defining a broad class of solutions (the easy part) and the other requesting one particular such solution optimal in some sense (the hard part). This report introduces a binary relationa...
متن کاملExtensions of Galois Connections
Galois connections play a very important role in the theory of continuous lattices and their various generalizations. (See, for example, [1], [2], [a], [4], [5], [7] and [9].) Morphisms of continuous lattices, as defined in [2], are precisely those upper adjoints of Galois connections which preserve directed sups. In [1] Bandelf and Ernd suggested that the right choice of morphisms for Z-contin...
متن کاملFuzzy Galois Connections
The concept of Galois connection between power sets is generalized from the point of view of fuzzy logic. Studied is the case where the structure of truth values forms a complete residuated lattice. It is proved that fuzzy Galois connections are in one-to-one correspondence with binary fuzzy relations. A representation of fuzzy Galois connections by (classical) Galois connections is provided. 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2008
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2008.06.003