22 research outputs found

    Activating Generalized Fuzzy Implications from Galois Connections

    Get PDF
    This paper deals with the relation between fuzzy implications and Galois connections, trying to raise the awareness that the fuzzy implications are indispensable to generalise Formal Concept Analysis. The concrete goal of the paper is to make evident that Galois connections, which are at the heart of some of the generalizations of Formal Concept Analysis, can be interpreted as fuzzy incidents. Thus knowledge processing, discovery, exploration and visualization as well as data mining are new research areas for fuzzy implications as they are areas where Formal Concept Analysis has a niche.F.J. Valverde-Albacete—was partially supported by EU FP7 project LiMoSINe, (contract 288024). C. Peláez-Moreno—was partially supported by the Spanish Government-CICYT project 2011-268007/TEC.Publicad

    Inverse System in The Category of Intuitionistic Fuzzy Soft Modules

    Get PDF
    This paper begins with the basic concepts of soft module. Later, we introduce inverse system in the category of intutionistic fuzzy soft modules and prove that its limit exists in this category. Generally, limit of inverse system of exact sequences of intutionistic fuzzy soft modules is not exact. Then we define the notion  which is first derived functor of the inverse limit functor. Finally, using methods of homology algebra, we prove that the inverse system limit of exact sequence of intutionistic fuzzy soft modules is exact

    An Abstract Approach to Consequence Relations

    Full text link
    We generalise the Blok-J\'onsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and J\'onsson admit, in place of sheer formulas, a wider range of syntactic units to be manipulated in deductions (including sequents or equations), these objects are invariably aggregated via set-theoretical union. Our approach is more general in that non-idempotent forms of premiss and conclusion aggregation, including multiset sum and fuzzy set union, are considered. In their abstract form, thus, deductive relations are defined as additional compatible preorderings over certain partially ordered monoids. We investigate these relations using categorical methods, and provide analogues of the main results obtained in the general theory of consequence relations. Then we focus on the driving example of multiset deductive relations, providing variations of the methods of matrix semantics and Hilbert systems in Abstract Algebraic Logic

    Relating Kleene algebras with pseudo uninorms

    Get PDF
    This paper explores a strict relation between two core notions of the semantics of programs and of fuzzy logics: Kleene Algebras and (pseudo) uninorms. It shows that every Kleene algebra induces a pseudo uninorm, and that some pseudo uninorms induce Kleene algebras. This connection establishes a new perspective on the theory of Kleene algebras and provides a way to build (new) Kleene algebras. The latter aspect is potentially useful as a source of formalism to capture and model programs acting with fuzzy behaviours and domains.publishe

    Functorial comparisons of bitopology with topology and the case for redundancy of bitopology in lattice-valued mathematics

    Full text link
    [EN] This paper studies various functors between (lattice-valued) topology and (lattice-valued) bitopology, including the expected “doubling” functor Ed : L-Top → L-BiTop and the “cross” functor E× : L-BiTop → L2-Top introduced in this paper, both of which are extremely well-behaved strict, concrete, full embeddings. Given the greater simplicity of lattice-valued topology vis-a-vis lattice-valued bitopology and the fact that the class of L2-Top’s is strictly smaller than the class of L-Top’s encompassing fixed-basis topology, the class of E×’s makes the case that lattice-valued bitopology is categorically redundant. As a special application, traditional bitopology as represented by BiTop is (isomorphic in an extremely well-behaved way to) a strict subcategory of 4-Top, where 4 is the four element Boolean algebra; this makes the case that traditional bitopology is a special case of a much simpler fixed-basis topology.Support of Youngstown State University via a sabbatical for the 2005–2006 academic year is gratefully acknowledged.Rodabaugh, S. (2008). Functorial comparisons of bitopology with topology and the case for redundancy of bitopology in lattice-valued mathematics. Applied General Topology. 9(1):77-108. doi:10.4995/agt.2008.1871.SWORD771089

    Soft Neutrosophic Loops and Their Generalization

    Get PDF
    Soft set theory is a general mathematical tool for dealing with uncertain, fuzzy, not clearly defined objects. In this paper we introduced soft neutrosophic loop,soft neutosophic biloop, soft neutrosophic N -loop with the discuission of some of their characteristics. We also introduced a new type of soft neutrophic loop, the so called soft strong neutrosophic loop which is of pure neutrosophic character. This notion also found in all the other corresponding notions of soft neutrosophic thoery. We also given some of their properties of this newly born soft structure related to the strong part of neutrosophic theory

    Soft Neutrosophic Loops and Their Generalization

    Get PDF
    Soft set theory is a general mathematical tool for dealing with uncertain, fuzzy, not clearly defined objects. In this paper we introduced soft neutrosophic loop,soft neutosophic biloop, soft neutrosophic N -loop with the discuission of some of their characteristics. We also introduced a new type of soft neutrophic loop, the so called soft strong neutrosophic loop which is of pure neutrosophic character. This notion also found in all the other corresponding notions of soft neutrosophic thoery. We also given some of their properties of this newly born soft structure related to the strong part of neutrosophic theory

    Pairwise comparison matrix in multiple criteria decision making

    Get PDF
    The measurement scales, consistency index, inconsistency issues, missing judgment estimation and priority derivation methods have been extensively studied in the pairwise comparison matrix (PCM). Various approaches have been proposed to handle these problems, and made great contributions to the decision making. This paper reviews the literature of the main developments of the PCM. There are plenty of literature related to these issues, thus we mainly focus on the literature published in 37 peer reviewed international journals from 2010 to 2015 (searched via ISI Web of science). We attempt to analyze and classify these literatures so as to find the current hot research topics and research techniques in the PCM, and point out the future directions on the PCM. It is hoped that this paper will provide a comprehensive literature review on PCM, and act as informative summary of the main developments of the PCM for the researchers for their future research. First published online: 02 Sep 201
    corecore