Fuzzy Galois connections on fuzzy posets

The concept of fuzzy Galois connections is defined on fuzzy posets with Bělohlávek's fuzzy Galois connections as a special case. The properties of fuzzy Galois connections are investigated. Then the relations between fuzzy Galois connections and fuzzy closure operators, fuzzy interior operators are studied. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

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.     

A general approach to fuzzy concepts

The paper proposes a flexible way to build concepts within fuzzy logic and set theory. The framework is general enough to capture some important particular cases, with their own independent interpretations, like “antitone” or “isotone” concepts constructed from fuzzy binary relations, but also to allow the two universes (of objects and attributes) to be equipped each with its own truth structure. Perhaps the most important feature of our approach is that we do not commit ourselves to any kind of logical connector, covering thus the case of a possibly non‐commutative conjunction too. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Interior Operators and Topological Connectedness

Abstract

A categorical notion of interior operator is used in topology to define connectedness and disconnectedness with respect to an interior operator. A commutative diagram of Galois connections is used to show a relationship between these notions and Arhangelskii and Wiegandt's notions of connectedness and disconnectedness with respect to a subclass of topological spaces. Examples are included.     

Topos中的Galois联络

In this paper, we investigate the Galois connections between two partially ordered objects in an arbitrary elementary topos. Some characterizations of Galois adjunctions which is similar to the classical case are obtained by means of the diagram proof. This shows that the diagram method can be used to reconstruct the classical order theory in an arbitrary elementary topos.     

Lattices of Fixed Points of Fuzzy Galois Connections

We give a characterization of the fixed points and of the lattices of fixed points of fuzzy Galois connections. It is shown that fixed points are naturally interpreted as concepts in the sense of traditional logic.     

A Link Between Two Connectedness Notions

The composition of two previously introduced Galois connections is used to provide a wider perspective on the Clementino–Tholen connectedness versus separation Galois connection. Moreover, a link between this and Castellini's connectedness–disconnectednes Galois connection is also presented.     

Relational Galois connections between transitive fuzzy digraphs

Fuzzy-directed graphs are often chosen as the data structure to model and implement solutions to several problems in the applied sciences. Galois connections have also shown to be useful both in theoretical and in practical problems. In this paper, the notion of relational Galois connection is extended to be applied between transitive fuzzy directed graphs. In this framework, the components of the connection are crisp relations satisfying certain reasonable properties given in terms of the so-called full powering.     

Fuzzy closure systems on L—ordered sets

In this paper, notions of fuzzy closure system and fuzzy closure L —system on L —ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems (fuzzy closure L —systems) and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

模糊概念格与模糊推理

基于伽罗瓦连接,分别在交换伴随对与对合剩余格条件下,讨论了模糊概念格的四种定义形式。并证明了在对合剩余格上,对偶性成立,四种模糊算子将具有与经典意义下一致的相互关系。最后我们提出了一种基于模糊概念格的模糊推理规则,并证明了其还原性。     

On Hopf Galois Extension of Separable Algebras

In this paper, the classical Galois theory to the H*-Galois case is developed. Let H be a semisimple and cosemisimple Hopf algebra over a field k, A a left H-module algebra,and A/AHa right H*-Galois extension. The authors prove that, if AHis a separable kalgebra, then for any right coideal subalgebra B of H, the B-invariants A~B= {a ∈ A |b · a = ε(b)a, b∈ B} is a separable k-algebra. They also establish a Galois connection between right coideal subalgebras of H and separable subalgebras of A containing AHas in the classical case. The results are applied to the case H =(kG)*for a finite group G to get a Galois 1-1 correspondence.     

On a logic of involutive quantales

The logic just corresponding to (non‐commutative) involutive quantales, which was introduced by Wendy MacCaull, is reconsidered in order to obtain a cut‐free sequent calculus formulation, and the completeness theorem (with respect to the involutive quantale model ) for this logic is proved using a new admissible rule. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

一种基于Galois联络的逻辑及其等价形式

将形式化方法引入到Galois联络的研究当中,提出了一种基于Galois联络的逻辑系统LGC,给出了其等价形式并证明了完备性定理.由于Galois联络与粗糙集及概念格有着紧密的联系,故本文的结果对概念格及粗糙集的形式化研究有一定的启示作用.     

How to fuzzify a closure space

It is shown here how the Galois connections theory provides a canonical procedure to fuzzify a crisp closure space. Roughly speaking, if S is a space equipped with an ∩-closed set of subsets (the closed subsets), the closed fuzzy subsets of S are the Galois connections between and the valuation set. The closed crisp subsets are particular closed fuzzy subsets.     

Archimedean classes in integral commutative residuated chains

This paper investigates a quasi‐variety of representable integral commutative residuated lattices axiomatized by the quasi‐identity resulting from the well‐known Wajsberg identity (p → q) → q ≤ (q → p) → p if it is written as a quasi‐identity, i. e., (p → q) → q ≈ 1 ? (q → p) → p ≈ 1 . We prove that this quasi‐identity is strictly weaker than the corresponding identity. On the other hand, we show that the resulting quasi‐variety is in fact a variety and provide an axiomatization. The obtained results shed some light on the structure of Archimedean integral commutative residuated chains. Further, they can be applied to various subvarieties of MTL‐algebras, for instance we answer negatively Hájek's question asking whether the variety of ΠMTL‐algebras is generated by its Archimedean members (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On (∈, ∈ ∨ q)‐fuzzy filters of R0‐algebras

In this paper, we introduce the notions of (∈, ∈ ∨ q)‐fuzzy filters and (∈, ∈ ∨ q)‐fuzzy Boolean (implicative) filters in R₀‐algebras and investigate some of their related properties. Some characterization theorems of these generalized fuzzy filters are derived. In particular, we prove that a fuzzy set in R₀‐algebras is an (∈, ∈ ∨ q)‐fuzzy Boolean filter if and only if it is an (∈, ∈ ∨ q)‐fuzzy implicative filter. Finally, we consider the concepts of implication‐based fuzzy Boolean (implicative) filters of R₀‐algebras (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Extracting compact and information lossless sets of fuzzy association rules

Applying classical association rule extraction framework on fuzzy datasets leads to an unmanageably highly sized association rule sets. Moreover, the discretization operation leads to information loss and constitutes a hamper towards an efficient exploitation of the mined knowledge. To overcome such a drawback, this paper proposes the extraction and the exploitation of compact and informative generic basis of fuzzy association rules. The presented approach relies on the extension, within the fuzzy context, of the notion of closure and Galois connection, that we introduce in this paper. In order to select without loss of information a generic subset of all fuzzy association rules, we define three fuzzy generic basis from which remaining (redundant) FARs are generated. This generic basis constitutes a compact nucleus of fuzzy association rules, from which it is possible to informatively derive all the remaining rules. In order to ensure a sound and complete derivation process, we introduce an axiomatic system allowing the complete derivation of all the redundant rules. The results obtained from experiments carried out on benchmark datasets are very encouraging. They highlight a very important reduction of the number of the extracted fuzzy association rules without information loss.     

Large time behaviour of solutions to Penrose–Fife phase change models

A non‐conserved phase transition model of Penrose–Fife type is considered where Dirichlet boundary conditions for the temperature are taken. A sketch of the proof of existence and uniqueness of the solution is given. Then, the large time behaviour of such a solution is studied. By using the Simon–?ojasiewicz inequality it is shown that the whole solution trajectory converges to a single stationary state. Due to the non‐coercive character of the energy functional, the main difficulty in the proof is to control the large values of the temperature. This is achieved by means of non‐standard a priori estimates. Copyright © 2005 John Wiley & Sons, Ltd.     

Categorical Abstract Algebraic Logic: Algebraic Semantics for (\documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf{\pi }$\end{document})‐Institutions

Various aspects of the work of Blok and Rebagliato on the algebraic semantics for deductive systems are studied in the context of logics formalized as π‐institutions. Three kinds of semantics are surveyed: institution, matrix (system) and algebraic (system) semantics, corresponding, respectively, to the generalized matrix, matrix and algebraic semantics of the theory of sentential logics. After some connections between matrix and algebraic semantics are revealed, it is shown that every (finitary) N‐rule based extension of an N‐rule based π‐institution possessing an algebraic semantics also possesses an algebraic semantics. This result abstracts one of the main theorems of Blok and Rebagliato. An attempt at a Blok‐Rebagliato‐style characterization of those π‐institutions with a mono‐unary category of natural transformations on their sentence functors having an algebraic semantics is also made. Finally, a necessary condition for a π‐institution to possess an algebraic semantics is provided.