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.

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 Galois connections is provided.

This paper presents a systematic investigation of fuzzy Galois connections in the sense of R. Bělohlávek [1], from the point of view of enriched category theory. The results obtained show that the theory of enriched categories makes it possible to present the theory of fuzzy Galois connections in a succinct way; and more importantly, it provides a useful method to express and to study the link and the difference between the commutative and the non-commutative worlds.

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.

The lack of double negation and de Morgan properties makes fuzzy logic unsymmetrical. This is the reason why fuzzy versions of notions like closure operator or Galois connection deserve attention for both antiotone and isotone cases, these two cases not being dual. This paper offers them attention, comming to the following conclusions: – some kind of hardly describable ‘‘local preduality’’ still makes possible important parallel results; – interesting new concepts besides antitone and isotone ones (like, for (...) instance, conjugated pair), that were classically reducible to the first, gain independency in fuzzy setting. (shrink)

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 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.

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 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. (shrink)

. 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.

The method based on the idea of Galois connection is well known. It facilitates investigations into similarities between mathematical structures, including isomorphisms between these structures, the highest degree of similarity. This idea is employed here and adapted so as to get to the core of aspects of the relationship between some metamathematical structures. The focus is put on the relation between traditional methodological orthodoxy based on the idea of proof , on the one hand, and on some alternative (...) methodological set-ups based on other ideas such as consistency or some forms of maximality, on the other hand. (shrink)

Preface 1 Partially ordered sets 1.1 Posets introduced 1.2 Partial orders and strict orders 1.3 Maps between posets 1.4 Compounding maps 1.5 Order similarity 1.6 Inclusion posets as typical..

We construct a Galois connection between closure and interior operators on a given set. All arguments are intuitionistically valid. Our construction is an intuitionistic version of the classical correspondence between closure and interior operators via complement.

In this work, an intuitionistic propositional logic with a Galois connection is introduced. In addition to the intuitionistic logic axioms and inference rule of modus ponens, the logic contains only two rules of inference mimicking the performance of Galois connections. Both Kripke-style and algebraic semantics are presented for IntGC, and IntGC is proved to be complete with respect to both of these semantics. We show that IntGC has the finite model property and is decidable, but Glivenko's Theorem (...) does not hold. Duality between algebraic and Kripke semantics is presented, and a representation theorem for Heyting algebras with Galois connections is proved. In addition, an application to rough L-valued sets is presented. (shrink)

In this paper we introduce Hilbert algebras with Hilbert–Galois connections (HilGC-algebras) and we study the Hilbert–Galois connections defined in Heyting algebras, called HGC-algebras. We assign a categorical duality between the category HilGC-algebras with Hilbert homomorphisms that commutes with Hilbert–Galois connections and Hilbert spaces with certain binary relations and whose morphisms are special functional relations. We also prove a categorical duality between the category of Heyting Galois algebras with Heyting homomorphisms that commutes with Hilbert–Galois connections and (...) the category of spectral Heyting spaces endowed with a binary relation with certain special continuous maps. (shrink)

The aim of this paper is to elucidate the relationship between Aristotelian conceptual oppositions, commutative diagrams of relational structures, and Galois connections.This is done by investigating in detail some examples of Aristotelian conceptual oppositions arising from topological spaces and similarity structures. The main technical device for this endeavor is the notion of Galois connections of order structures.

Two examples of Galois connections and their dual forms are considered. One of them is applied to formulate a criterion when a given subset of a complete lattice forms a complete lattice. The second, closely related to the first, is used to prove in a short way the Knaster-Tarski’s fixed point theorem.

The relation between noise and disturbance is investigated within the general framework of Galois connections. Within this framework, we introduce the notion of leak of information, mathematically defined as one of the two closure maps arising from the observable-channel compatibility relation. We provide a physical interpretation for it, and we give a comparison with the analogous closure maps associated with joint measurability and simulability for quantum observables.

While the past century of neuroscientific research has brought considerable progress in defining the boundaries of the human cerebral cortex, there are cases in which the demarcation of one area from another remains fuzzy. Despite the existence of clearly demarcated areas, examples of gradual transitions between areas are known since early cytoarchitectonic studies. Since multi-modal anatomical approaches and functional connectivity studies brought renewed attention to the topic, a better understanding of the theoretical and methodological implications of fuzzy boundaries (...) in brain science can be conceptually useful. This article provides a preliminary conceptual framework to understand this problem by applying philosophical theories of vagueness to three levels of neuroanatomical research. For the first two levels (cytoarchitectonics and fMRI studies), vagueness will be distinguished from other forms of uncertainty, such as imprecise measurement or ambiguous causal sources of activation. The article proceeds to discuss the implications of these levels for the anatomical study of connectivity between cortical areas. There, vagueness gets imported into connectivity studies since the network structure is dependent on the parcellation scheme and thresholds have to be used to delineate functional boundaries. Functional connectivity may introduce an additional form of vagueness, as it is an organizational principle of the brain. The article concludes by discussing what steps are appropriate to define areal boundaries more precisely. (shrink)

There are inequalities between cardinal characteristics of the continuum that are true in any model of ZFC, but without a Borel morphism proving the inequality. We answer some questions from Blass [1].

This paper is a continuation of investigations on Galois connections from [1], [3], [10]. It is a continuation of [2]. We have shown many results that link properties of a given closure space with that of the dual space. For example: for every -disjunctive closure space X the dual closure space is topological iff the base of X generated by this dual space consists of the -prime sets in X (Theorem 2). Moreover the characterizations of the satisfiability relation for (...) classical logic are shown. Roughly speaking our main result here is the following: a satisfiability relation in a logic L with, a countable language is a fragment of the classical one iff the compactness theorem for L holds (Theorems 3–8). (shrink)

In many applications we have a set of objects together with their properties. Since the available information is usually incomplete and/or imprecise, the true knowledge about subsets of objects can be determined approximately only. In this paper, we discuss a fuzzy generalisation of two pairs of relation-based operators suitable for fuzzy set approximations, which have been recently investigated by Düntsch and Gediga. Double residuated lattices, introduced by Orlowska and Radzikowska, are taken as basic algebraic structures. Main properties of (...) these operators are presented. (shrink)

Shared conceptualization, in the sense we take it here, is as recent a notion as the Semantic Web, but its relevance for a large variety of fields requires efficient methods of extraction and representation for both quantitative and qualitative data. This notion is particularly relevant for the investigation into, and construction of, semantic structures such as knowledge bases and taxonomies, but given the required large, often inaccurate, corpora available for search we can get only approximations. We see fuzzy description (...) logic as an adequate medium for the representation of human semantic knowledge and propose a means to couple it with fuzzy semantic networks via the propositional Łukasiewicz fuzzy logic such that these suffice for decidability for queries over a semantic-knowledge base such as “to what degree of sharedness does it entail the instantiation C(a) for some concept C” or “what are the roles R that connect the individuals a and b to degree of sharedness ε.” . (shrink)

Fuzzy intuitionistic quantum logics (called also Brouwer-Zadeh logics) represent to non standard version of quantum logic where the connective not is split into two different negation: a fuzzy-like negation that gives rise to a paraconsistent behavior and an intuitionistic-like negation. A completeness theorem for a particular form of Brouwer-Zadeh logic (BZL 3) is proved. A phisical interpretation of these logics can be constructed in the framework of the unsharp approach to quantum theory.

In this paper we investigate the connections between quantifier elimination, decidability and Uniform Craig Interpolation in Δ-core fuzzy logics added with propositional quantifiers. As a consequence, we are able to prove that several propositional fuzzy logics have a conservative extension which is a Δ-core fuzzy logic and has Uniform Craig Interpolation.

Symmetric generalized Galois logics (i.e., symmetric gGl s) are distributive gGl s that include weak distributivity laws between some operations such as fusion and fission. Motivations for considering distribution between such operations include the provability of cut for binary consequence relations, abstract algebraic considerations and modeling linguistic phenomena in categorial grammars. We represent symmetric gGl s by models on topological relational structures. On the other hand, topological relational structures are realized by structures of symmetric gGl s. We generalize the (...) weak distributivity laws between fusion and fission to interactions of certain monotone operations within distributive super gGl s. We are able to prove appropriate generalizations of the previously obtained theorems—including a functorial duality result connecting classes of gGl s and classes of structures for them. (shrink)

It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbert style. Moreover, it is proven that any truth-functional semantics whose connectives are interpreted in [0,1] by continuous functions is axiomatizable by a fuzzy deduction system (but not by an effective fuzzy deduction system, in general).

Many results in fuzzy logic depend on the mathematical structure the truth value set obeys. In this textbook the algebraic foundations of many-valued and fuzzy reasoning are introduced. The book is self-contained, thus no previous knowledge in algebra or in logic is required. It contains 134 exercises with complete answers, and can therefore be used as teaching material at universities for both undergraduated and post-graduated courses. Chapter 1 starts from such basic concepts as order, lattice, equivalence and residuated (...) lattice. It contains a full section on BL-algebras. Chapter 2 concerns MV-algebra and its basic properties. Chapter 3 applies these mathematical results on Lukasiewicz-Pavelka style fuzzy logic, which is studied in details; besides semantics, syntax and completeness of this logic, a lot of examples are given. Chapter 4 shows the connection between fuzzy relations, approximate reasoning and fuzzy IF-THEN rules to residuated lattices. (shrink)

Power structures are obtained by lifting some mathematical structure (operations, relations, etc.) from an universe X to its power set ${\mathcal{P}(X)}$ . A similar construction provides fuzzy power structures: operations and fuzzy relations on X are extended to operations and fuzzy relations on the set ${\mathcal{F}(X)}$ of fuzzy subsets of X. In this paper we study how this construction preserves some properties of fuzzy sets and fuzzy relations (similarity, congruence, etc.). We define the notions (...) of good, very good, Hoare good and Smith good fuzzy relation and establish some connections between them, generalizing some results of Brink, Bošnjak and Madarász on power structures. (shrink)

The objective of this article is to characterise elimination of finite generalised imaginaries as defined in [9] in terms of group cohomology. As an application, I consider series of Zariski geometries constructed [10, 23, 24] by Hrushovski and Zilber and indicate how their nondefinability in algebraically closed fields is connected to eliminability of certain generalised imaginaries.

The short exposition of the triplet model of concepts and some definitions connected with it are given. In this model any concept may be depicted as having three characteristics: a base, a representing part and the linkage between them. The paper introduces the fuzzification of concepts in terms of the triplet model.

This paper is a contribution to the development of fuzzy logic in narrow sense with evaluated syntax and connectives interpreted in Łukasiewicz algebra. The main results concern model theory of fuzzy logic and generalization of the Craig-Robinson's theorem on joint consistency of fuzzy theories as well as Craig's interpolation theorem.

Let S be a set, P the class of all subsets of S and F the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P into a fuzzy closure operator J* defined in F. This enables us to give the notion of canonical extension of a deduction system (...) and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory. (shrink)

This paper is an attempt to develop the many-valued first-order fuzzy logic. The set of its truth, values is supposed to be either a finite chain or the interval 0, 1 of reals. These are special cases of a residuated lattice L, , , , , 1, 0. It has been previously proved that the fuzzy propositional logic based on the same sets of truth values is semantically complete. In this paper the syntax and semantics of the first-order (...) fuzzy logic is developed. Except for the basic connectives and quantifiers, its language may contain also additional n-ary connectives and quantifiers. Many propositions analogous to those in the classical logic are proved. The notion of the fuzzy theory in the first-order fuzzy logic is introduced and its canonical model is constructed. Finally, the extensions of Gödel's completeness theorems are proved which confirm that the first-order fuzzy logic is also semantically complete. (shrink)

First the expansion of the Łukasiewicz logic by the unary connectives of dividing by any natural number is studied; it is shown that in the predicate case the expansion is conservative w.r.t. witnessed standard 1-tautologies. This result is used to prove that the set of witnessed standard 1-tautologies of the predicate product logic is Π2-hard.

This paper is devoted to the study of the notion of the phase-space representation of quantum theory in both the nonrelativisitic and the relativisitic cases. Then, as a derived concept, the stochastic phase space is introduced and its connections with fuzzy set theory and probabilistic topological (in particular, metric) spaces are discussed.

ABSTRACT In this work the connections between the fuzzy closure operators and the graded consequence relations are examined Namely, as it is well known, in the crisp case there is a complete equivalence between the notion of closure operator and the one of consequence relation. We extend this result by proving that the graded consequence relations are related to a particular class of fuzzy closure operators, namely the class of fuzzy closure operators that can be obtained by (...) a chain of classical closure operators. (shrink)

The Wiener index WI is one of the connectivity parameters used to know the biochemical and physicochemical properties of compounds depending upon their molecular structures. Intuitionistic fuzzy graphs IFG s are a convenient tool to represent the objects and relations between them with two types of information using truth membership degree and falsity membership degree. This research work presents the concept of WI under the structure IFG s, I F trees, and I F cycles. Some bounds on WI are (...) investigated. The relationship between WI and connectivity index CI is also studied. In the end of this study, an application of the WI in transport network flow is proposed. (shrink)

A novel algebraic structure of the genetic code is proposed. Here, the principal partitions of the genetic code table were obtained as equivalent classes of quotient spaces of the genetic code vector space over the Galois field of the four DNA bases. The new algebraic structure shows strong connections among algebraic relationships, codon assignment and physicochemical properties of amino acids. Moreover, a distance function defined between the codon binary representations in the vector space was demonstrated to have a linear (...) behavior respect to physical variables such as the mean of amino acids interaction energies in proteins. It was also noticed that the distance between wild type and mutant codons approach to smaller values in mutational variants of four genes, i.e., human phenylalanine hydroxylase, human β-globin, HIV-1 protease and HIV-1 reverse transcriptase. These results strongly suggest that deterministic rules must be involved in the genetic code origin. (shrink)

The article begins with a discussion of sets and fuzzy sets. It is observed that identifying a set with its indicator function makes it clear that a fuzzy set is a direct and natural generalization of a set. Making this identification also provides simplified proofs of various relationships between sets. Connectives for fuzzy sets that generalize those for sets are defined. The fundamentals of ordinary probability theory are reviewed and these ideas are used to motivate fuzzy (...) probability theory. Observables (fuzzy random variables) and their distributions are defined. Some applications of fuzzy probability theory to quantum mechanics and computer science are briefly considered. (shrink)

The regression model is generally utilized in several fields of study because of its applications. Regression is an extremely incredible approach; it builds up a connection between dependent and independent variables. We have addressed a powerful computational model by utilizing dengue information joined with fuzzy multiple linear regression. Information is accumulated on dengue fever through the survey. This paper is centered on the comparison of the crisp method with fuzzy multiple linear regression, and then, the utilization of (...) a fuzzy multiple regression method is explained after the comparison. We have used multiple regression and then converted the said technique into three fuzzy cases. The effectiveness of the fuzzy multiple regression model is measured by numerical computation and comparison of both techniques. 2020 Mathematics Subject Classification. Primary 30C45; 30C50; 30C80; Secondary 11B65, 47B38. (shrink)

Neutrosophic set is a new mathematical tool for handling problems involving imprecise, indetermi nacy and inconsistent data. Pseudo-BCI algebra is a kind of non-classical logic algebra in close connection with various non-commutative fuzzy logics. Recently, we applied neutrosophic set theory to pseudo-BCI al gebras. In this paper, we study neutrosophic filters in pseudo-BCI algebras. The concepts of neutrosophic regular filter, neutrosophic closed filter and fuzzy regular filter in pseudo-BCI algebras are introduced, and some basic properties are discussed. (...) Moreover, the relationships among neutrosophic regular filter, fuzzy filters and anti-grouped neutrosophic filters are prese nted, and the results are proved: a neutrosophic filter (fuzzy filter) is a neutrosophic regular filter (fuzzy regular filter), if and only if it is both a neutrosophic closed filter (fuzzy closed filter) and an anti-grouped neutrosophic filter (fuzzy anti-grouped filter). (shrink)

We investigate the variety corresponding to a logic, which is the combination of ukasiewicz Logic and Product Logic, and in which Gödel Logic is interpretable. We present an alternative axiomatization of such variety. We also investigate the variety, called the variety of algebras, corresponding to the logic obtained from by the adding of a constant and of a defining axiom for one half. We also connect algebras with structures, called f-semifields, arising from the theory of lattice-ordered rings, and prove that (...) every algebra can be regarded as a structure whose domain is the interval [0, 1] of an f-semifield, and whose operations are the truncations of the operations of to [0, 1]. We prove that such a structure is uniquely determined by up to isomorphism, and we establish an equivalence between the category of algebras and that of f-semifields. (shrink)

This is an exploratory paper whose aim is to investigate the potentialities of bilattice theory for an adequate definition of the deduction apparatus for multi-valued logic. We argue that bilattice theory enables us to obtain a nice extension of the graded approach to fuzzy logic. To give an example, a completeness theorem for a logic based on Boolean algebras is proved.

This article investigates five kinds of vagueness in medicine: disciplinary, ontological, conceptual, epistemic, and vagueness with respect to descriptive-prescriptive connections. First, medicine is a discipline with unclear borders, as it builds on a wide range of other disciplines and subjects. Second, medicine deals with many indistinct phenomena resulting in borderline cases. Third, medicine uses a variety of vague concepts, making it unclear which situations, conditions, and processes that fall under them. Fourth, medicine is based on and produces uncertain knowledge and (...) evidence. Fifth, vagueness emerges in medicine as a result of a wide range of fact-value-interactions. The various kinds of vagueness in medicine can explain many of the basic challenges of modern medicine, such as overdiagnosis, underdiagnosis, and medicalization. Even more, it illustrates how complex and challenging the field of medicine is, but also how important contributions from the philosophy can be for the practice of medicine. By clarifying and, where possible, reducing or limiting vagueness, philosophy can help improving care. Reducing the various types of vagueness can improve clinical decision-making, informing individuals, and health policy making. (shrink)