Contour Lines: The Lost World
|
|
- Hubert Douglas
- 5 years ago
- Views:
Transcription
1 Contour Lines: The Lost World K. Maes Department of Applied Mathematics, Biometrics and Process Control, Ghent University, Coupure links 653, B-9000 Gent, Belgium B. De Baets Department of Applied Mathematics, Biometrics and Process Control, Ghent University, Coupure links 653, B-9000 Gent, Belgium Abstract Contour lines totally fix the structure of leftcontinuous t-norms. For each t-norm, these contour lines are determined by the corresponding residual implicator. Most properties involving residual implicators can now easily be translated into properties involving contour lines. As the portation law expresses associativity, we dispose of a powerful tool for constructing left-continuous t-norms. In particular, we focus on the decomposition and construction of t-norms that are rotation invariant w.r.t. one of their contour lines. Keywords: Left-continuous t-norm, rotationinvariant t-norm, portation law, contour line, associativity 1 Introduction After Schweizer and Sklar [12] introduced triangular norms in order to generalize the triangle inequality towards probabilistic metric spaces, t- norms have been widely used in fuzzy set theory. So far only the class of continuous t-norms has been characterized. However, diverse construction methods have been proposed for creating new t-norms. Most of these methods start from a known t-norm on which a bunch of operations such as rotations, annihilations and rescalings is performed. In other cases multiple t-norms are merged into a brand new t-norm. Unfortunately, these constructions were only elaborated for restricted classes of t-norms. In this contribution we try to analyse the basic structure of leftcontinuous t-norms. A left-continuous t-norm is completely fixed by its contour lines. Expressing its associativity by means of these contour lines, enables us to gain more insight in the structure of the t-norm in question. We are able to interpret the rotation and rotation-annihilation construction of Jenei [7, 8, 9, 10] into a new and more general framework, covering all known examples of rotation-invariant t-norms. Furthermore, working with contour lines allows us to tackle other construction methods. We briefly indicate our further results. Throughout this contribution, we use the standard notations for the prototypical t-norms and t-conorms [11]. We say that a t-norm T has zero divisors if there exists a couple (x, y) ]0, 1] 2 such that T (x, y) = 0. For any t-norm T and any [0, 1]- automorphism φ (i.e. increasing permutation of [0, 1]), the φ-transform of T, defined by T φ (x, y) = φ 1 (T (φ(x), φ(y))), is a t-norm as well. A negator N is a decreasing [0, 1] [0, 1] mapping that satisfies the boundary conditions 0 N = 1 and 1 N = 0. Remark that we use the exponential notation x N to denote N(x). A negator is called involutive if (x N ) N = x, for all x [0, 1]. The standard negator N is defined by x N = 1 x. 2 Rotation-invariant t-norms In several studies dealing with t-norms, it seems that the t-norms in question should be leftcontinuous. In logic for example, where the implication is defined as the residiuum of the conjunction, left-continuous t-norms ensure the definability of the t-norm-based residual implicator [1]. 395
2 The residual implicator 1 of a t-norm T is defined by I T : [0, 1] 2 [0, 1] (x, y) sup{t [0, 1] T (x, t) y}. T is left-continuous if and only if the following condition (Galois connection) [3] is satisfied for every (x, y, z) [0, 1] 3 : T (x, z) y I T (x, y) z. (1) A t-norm T is called rotation invariant w.r.t. an involutive negator N if for every (x, y, z) [0, 1] 3 it holds that T (x, y) z T (y, z N ) x N. This property was first described by Fodor [2]. Jenei emphasized its geometrical interpretation by referring to it as the rotation invariance of T [5]. Rotation-invariant t-norms can easily be spotted by means of the following theorem. Theorem 1 [5] Consider a left-continuous t- norm T and an involutive negator N. The following statements are equivalent: 1. T is rotation invariant w.r.t. N; 2. I T (x, y) = z T (x, y N ) = z N, for every (x, y, z) [0, 1] 3 ; 3. I T (x, 0) = x N, for every x [0, 1]. The second assertion in the theorem is also known as the self quasi-inverse property. The negator N : [0, 1] [0, 1] : x I T (x, 0) is called the residual negator of T. Rotation invariance itself also implies the left-continuity of the t-norm in question [5]. Despite their importance, until recently little was known concerning the structure of left-continuous t-norms. Jenei provided a real breakthrough by introducing his rotation construction, rotation annihilation construction and embedding method 1 Strictly speaking, the term residual is only appropriate for a left-continuous t-norm T. [7, 8, 9, 10]. Starting from known t-norms, fulfilling some rather weak conditions, Jenei obtained rotation-invariant left-continuous t-norms by rescaling, rotating and annihilating the original ones. The Jenei t-norm family (Tλ J) λ [0,1/2], Tλ J (x, y) = 0, if x + y 1, x + y 1 + λ, if x + y > 1, and (x, y) ]λ, 1 λ] 2, min(x, y), elsewhere, (2) consists of left-continuous rotation-invariant (w.r.t. N ) t-norms [7], obtained by applying the rotation annihilation construction on T M and T L. Note that T0 J = T L and T1/2 J = T nm. 3 Contour lines Starting from a left-continuous [0, 1] 2 [0, 1] mapping, we can easily redefine left-continuous t- norms by means of contour lines. The neutral element, monotonicity and commutativity are easily translated to conditions on contour lines. Only associativity is quite difficult to fathom. We will show that associativity is equivalent to the portation law, which can be expressed by means of contour lines. Furthermore, we will provide necessary and sufficient conditions such that a leftcontinuous t-norm is rotation invariant w.r.t. one of its contour lines. In the basic logic BL [4] the following axioms are used to express residuation: (φ (ψ χ)) ((φ & ψ) χ), (3) ((φ & ψ) χ) (φ (ψ χ)), (4) with φ, ψ and χ formulas of the logic. The evaluation of both axioms in a BL-algebra ([0, 1],,, T, I T, 0, 1), with T a left-continuous t- norm and I T its residual implicator, must be eqaul to 1: I T (I T (x, I T (y, z)), I T (T (x, y), z)) = 1, (5) I T (I T (T (x, y), z), I T (x, I T (y, z))) = 1, (6) for every (x, y, z) [0, 1] 3. Since I T (x, y) = 1 = I T (y, x) only occurs for x = y, we can derive from 396
3 Eqs. (5) and (6) that I T (x, I T (y, z)) = I T (T (x, y), z) (7) holds for every (x, y, z) [0, 1] 3. The latter is also referred to as the portation law [5]. For every left-continuous t-norm T, (7) is always fulfilled. For every left-continous t-norm T, its residual implicator I T geometrically determines its contour lines : [0, 1] [0, 1] : x I T (x, a), with a [0, 1]. It will be clear from the context which t-norm T we are considering. Note that (x) = 1 if and only if x a. The geometrical perception of the residual implicator enables us to rewrite the portation law, expressed by (7), as follows: (T (x, y)) = C Ca(x)(y), (8) for every (x, y, a) [0, 1] 3. The symmetry of T implies that C Ca(x)(y) = C Ca(y)(x), which is also known as the exchange principle. Moreover, it is easily seen that (8) is trivially true when T (x, y) a. The portation law, expressed by (8), plays a profound role when dealing with a left-continuous t-norm T as it is equivalent to its associativity. Theorem 2 An increasing and left-continuous mapping T : [0, 1] 2 [0, 1] that fulfills for every x [0, 1] the boundary condition T (x, 0) = 0 is associative if and only if T fulfills the portation law. Moreover, the portation law enables us to gain a clearer understanding of the structure of leftcontinuous t-norms. Property 1 Consider a left-continuous t-norm T and a [0, 1[. The following statements are equivalent: 1. ( (x)) = x, for every x a; 2. C b (x) = C Ca(x)( (b)), for every b a. Given a negator N and a [0, 1[, define the mapping N a : [0, 1] [a, 1] by 1, if x a, ( ) x Na = x a N a + (1 a), elsewhere. 1 a In particular N 0 = N and x N 1 = 1, for every x [0, 1]. The function N a can be understood as a trivial extension of a rescaled version of N. We call N a involutive if (x Na ) Na = x, for every x a. Obviously, N a will be involutive if and only if N is an involutive negator. A t-norm T is said to be rotation invariant w.r.t. an involutive N a if T (x, y) z T (y, z Na ) x Na, for every (x, y, z) [a, 1] 3. The latter expresses that some kind of linear rescaling of T [a,1] 2 to [0, 1] 2 is rotation-invariant w.r.t. N. Applying that every rotation-invariant (w.r.t. an involutive negator N) t-norm is necessarily left-continuous [5], immediately leads to the following theorem. Theorem 3 Consider an involutive negator N and a [0, 1[. If a t-norm T is rotation invariant w.r.t. N a, then it is left-continuous on D = {(x, y) [0, 1] 2 x Na < y}. We are now able to rewrite and extend Theorem 1 as follows: Theorem 4 Consider a left-continuous t-norm T, an involutive negator N and a [0, 1[. The following statements are equivalent: 1. T is rotation invariant w.r.t. N a ; 2. C x (y) = C y Na (x Na ), for every (x, y) [a, 1] 2 ; 3. C b (x) = y T (x, b Na ) = y Na, for every (x, y, b) [a, 1] 3 ; 4. x Na = (x), for every x [a, 1]. Obviously, every continuous, Archimedian t-norm (i.e. a t-norm of the form (T P ) φ or (T L ) φ, with φ a [0, 1]-automorphism) is rotation invariant w.r.t. each of its countour lines. Property 2 Consider a left-continuous t-norm T and a [0, 1[. is involutive if and only if T (x, y) = (C Ca(x)(y)), (9) for every (x, y) fulfilling y > (x). 397
4 4 Constructing rotation-invariant t-norms If a t-norm T is rotation invariant w.r.t. an involutive decreasing [0, 1] [a, 1] mapping N a, then N a = and T is left-continuous strictly above its contour line. Assuming some continuity conditions, we will now attempt to reconstruct T in the area D strictly above. 1 a II IV I III 0 0 a 1 C (x) C (x) a Figure 1: The partition D = D I D II D III D IV. First, partition D into four parts as pictured in Figure 1: D I = {(x, y) ]β, 1] 2 y > C β (x)}, D II = {(x, y) ]a, β] ]β, 1] y > (x)}, D III = {(x, y) ]β, 1] ]a, β] y > (x)}, D IV = {(x, y) ]β, 1] 2 y C β (x)}. Denote β the unique fixpoint of (i.e. (β) = β). As will become clear, area D I is crucial in the construction and decomposition of rotationinvariant t-norms. Theorem 5 Consider a t-norm T that is rotation invariant w.r.t. one of its contour lines. Let σ be an arbitrary increasing bijection from [β, 1] to [0, 1], with β the unique fixpoint of. Then the [0, 1] 2 [0, 1] mapping T, defined by T (x, y) = σ(max(β, T (σ 1 [x], σ 1 [y]))), is a left-continuous t-norm. Denoting the contour lines of T by C b it also holds that T (x, y) = [ ] σ 1 T (σ(x), σ(y)), if (x, y) D I, (σ 1 Cσ(Ca(x))(σ(y)), if (x, y) D II, (σ 1 Cσ(Ca(y))(σ(x)), if (x, y) D III. (10) Interpreting this theorem, it follows that D I is in fact the rescaling of the area of T strictly above. Once T DI is known, it can be used to create T DII, which in turn can be used to construct T DIII. This leaves us to figure out how to fill up area D IV. In case D IV is empty we know how T D is constructed by means of a left-continuous t-norm T (i.e. the rescaling of T DI ) without zero divisors. Conversely, we wonder when an arbitrary left-continuous t-norm T without zero divisors ensures that T D fulfills the properties of a t-norm. Theorem 6 Consider an involutive negator N and a [0, 1[. Let T be a left-continuous t-norm without zero divisors and with contour lines C b. Define := N a and C β := ( ) β, with β the unique fixpoint of. Then T, defined by (10), is a symmetrical, increasing, associative mapping fulfilling T (x, 1) = x, for every x ]a, 1]. In particular, for a = 0 this theorem implies that T itself is a t-norm. Corollary 1 Consider an involutive negator N. Let T be a left-continuous t-norm without zero divisors and with contour lines C b. Define := N and C β := ( ) β, with β the unique fixpoint of. Then the [0, 1] 2 [0, 1] mapping T, defined by T (x, y) = 0, if (x, y) D, [ ] σ 1 T (σ(x), σ(y)), if (x, y) D I, (σ 1 Cσ(C0 (x))(σ(y)), if (x, y) D II, (σ 1 Cσ(C0 (y))(σ(x)), if (x, y) D III, is a rotation-invariant (w.r.t. N) t-norm. Our approach in the previous corollary is identical to the rotation construction of Jenei [7, 9]. On 398
5 the other hand, if T has zero divisors and we still want that T DI D IV is just a rescaling of T, then D IV must be a square. This case has also been covered by Jenei s rotation construction [7, 9]. For t-norms T that are continuous on D we will show that T D is totally fixed by T DI. Theorem 7 Consider a t-norm T that is rotation invariant w.r.t. one of its contour lines and that is continuous on D. Let σ be an arbitrary increasing bijection from [β, 1] to [0, 1], with β the unique fixpoint of. Then the [0, 1] 2 [0, 1] mapping T, defined by T (x, y) = σ(max(β, T (σ 1 [x], σ 1 [y]))), is a continuous t-norm. Denoting the contour lines of T by C b it also holds that T (x, y) = [ ] σ 1 T (σ(x), σ(y)), if (x, y) D I, (σ 1 Cσ(Ca(x))(σ(y)), if (x, y) D II, (σ 1 Cσ(Ca(y))(σ(x)), if (x, y) D III, (σ 1 T (σ(cβ (x)), σ(c β (y))), if (x, y) D IV. (11) Conversely, every continuous t-norm T can be used to construct T D. Theorem 8 Consider an involutive negator N and a [0, 1[. Let T be a continuous t-norm with contour lines C b. Define := N a and C β := ( ) β, with β the unique fixpoint of. Then T, defined by (11), is a symmetrical, increasing, associative mapping fulfilling T (x, 1) = x, for every x ]a, 1]. In case a = 0 we can create all rotation invariant (w.r.t. an involutive negator N) t-norms T that are continuous strictly above = N. Corollary 2 Consider an involutive negator N. Let T be a continuous t-norm with contour lines C b. Define := N and C β := ( ) β, with β the unique fixpoint of. Then the [0, 1] 2 [0, 1] mapping T, defined by T (x, y) = 0, if (x, y) D, [ ] σ 1 T (σ(x), σ(y)), if (x, y) D I, (σ 1 Cσ(C0 (x))(σ(y)), if (x, y) D II, (σ 1 Cσ(C0 (y))(σ(x)), if (x, y) D III, (σ 1 T (σ(cβ (x)), σ(c β (y))), if (x, y) D IV, is a rotation-invariant (w.r.t. N) t-norm. Since (T L ) φ, with φ a [0, 1]-automorphism, is continuous and rotation invariant w.r.t. each of its contour lines, Theorem 7 can be used to decompose such a t-norm. Take a [0, 1[ and let β be the unique fixpoint of. Then (T L ) φ D\DI is uniquely determined by (T L ) φ DI. In particular, (T L ) φ DI must be the rescaling of the strictly positive part of a t-norm (T L ) φ, with φ some [0, 1]- automorphism. Analogous results hold for (T P ) φ. We only need to restrict a to ]0, 1[. 5 Further research In the previous section we only presented a selection of our results. We are able to interpret Jenei s rotation-annihilation construction [8, 9] into our framework and we can uniquely determine T DIV under other specific extra conditions. Examining numerous examples, we know that T DIV is not always uniquely fixed by means of T DI. Also, not every left-continuous t-norm T is appropriate for constructing T D. Besides all these construction and decomposition results, we also used contour lines to derive necessary and sufficient conditions for the annihilation of t-norms. Our findings largely extend the existing knowledge (see e.g. [6]). These results will be reported upon in the near future. Given the numerous new insights contour lines provided on the structure of t-norms, we intend to investigate their importance for other aggregation operators. Furthermore, we plan to have a deeper look on the close relationship between contour lines and residual implicators, wondering 399
6 which new properties concerning contour lines are of interest for residual implicators. A more profound study of contour lines can be expected in future contributions. References [1] F. Esteva and L. Godo, Monoidal t- norm based logic: towards a logic for leftcontinuous t-norms, Fuzzy Sets and Systems, vol. 124, pp , [11] E. Klement, R. Mesiar and E. Pap, Triangular Norms, ser. Trends in Logic, vol. 8. Kluwer Academic Publishers, [12] B. Schweizer and A. Sklar, Probabilistic Metric Spaces. New York: Elsevier Science, [2] J. Fodor, A new look at fuzzy connectives, Fuzzy Sets and Systems, vol. 57, pp , [3] J. Fodor and M. Roubens, Fuzzy Preference Modelling and Multicriteria Decision Support. Kluwer Academic Publishers, [4] P. Hájek, Metamathematics of Fuzzy Logic, ser. Trends in Logic, vol. 4. Kluwer Academic Publishers, [5] S. Jenei, Geometry of left-continuous t- norms with strong induced negations, Belg. J. Oper. Res. Statist. Comput. Sci., vol. 38, pp. 5 16, [6], New family of triangular norms via contrapositive symmetrization of residual implications, Fuzzy Sets and Systems, vol. 110, pp , [7], Structure of left-continuous triangular norms with strong induced negations. (I) rotation construction. J. Appl. Non-Classical Logics, vol. 10, pp , [8], Structure of left-continuous triangular norms with strong induced negations. (II) rotation-annihilation construction. J. Appl. Non-Classical Logics, vol. 11, pp , [9], A characterization theorem on the rotation construction for triangular norms, Fuzzy Sets and Systems, vol. 136, pp , [10], How to construct left-continuous triangular norms - state of the art, Fuzzy Sets and Systems, vol. 143, pp ,
Disjunctive and Conjunctive Normal Forms in Fuzzy Logic
Disjunctive and Conjunctive Normal Forms in Fuzzy Logic K. Maes, B. De Baets and J. Fodor 2 Department of Applied Mathematics, Biometrics and Process Control Ghent University, Coupure links 653, B-9 Gent,
More informationOn Some Properties of Vague Lattices
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 31, 1511-1524 On Some Properties of Vague Lattices Zeynep Eken Akdeniz University, Faculty of Sciences and Arts Department of Mathematics, 07058-Antalya,
More informationLeft and right compatibility of strict orders with fuzzy tolerance and fuzzy equivalence relations
16th World Congress of the International Fuzzy Systems Association (IFSA) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT) Left and right compatibility of strict orders with
More informationIntersections between some families of (U,N)- and RU-implications
The final version of this work can be found at doi:10.1016/j.fss.2010.07.011. Intersections between some families of (U,N)- and RU-implications Micha l Baczyński a, Balasubramaniam Jayaram b a Institute
More informationGENERATING FUZZY IMPLICATIONS BY ORDINAL SUMS. 1. Introduction
t m Mathematical Publications DOI: 0.55/tmmp-206-008 Tatra Mt. Math. Publ. 66 (206), 39 50 GENERATING FUZZY IMPLICATIONS BY ORDINAL SUMS Pawe ldrygaś Anna Król ABSTRACT. This paper deals with ordinal sums
More informationOn Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order
On Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order Pavel Martinek Department of Computer Science, Palacky University, Olomouc Tomkova 40, CZ-779 00 Olomouc, Czech Republic
More informationFuzzy logic. 1. Introduction. 2. Fuzzy sets. Radosªaw Warzocha. Wrocªaw, February 4, Denition Set operations
Fuzzy logic Radosªaw Warzocha Wrocªaw, February 4, 2014 1. Introduction A fuzzy concept appearing in works of many philosophers, eg. Hegel, Nietzche, Marx and Engels, is a concept the value of which can
More informationGeneralized Implicative Model of a Fuzzy Rule Base and its Properties
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Generalized Implicative Model of a Fuzzy Rule Base and its Properties Martina Daňková Research report No. 55 2 Submitted/to
More informationReichenbach Fuzzy Set of Transitivity
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 9, Issue 1 (June 2014), pp. 295-310 Applications and Applied Mathematics: An International Journal (AAM) Reichenbach Fuzzy Set of
More informationFuzzy Stabilizer in IMTL-Algebras
Appl. Math. Inf. Sci. 8, No. 5, 2479-2484 (2014) 2479 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/080544 Fuzzy Stabilizer in IMTL-Algebras Maosen
More informationMonotonicity of fuzzy rule bases: On differences between graded and non-graded approaches
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Monotonicity of fuzzy rule bases: On differences between graded and non-graded approaches Martina Daňková, Martin Štěpnička,
More informationSome New Implication Operations Emerging From Fuzzy Logic
Some New Implication Operations Emerging From Fuzzy Logic Manish K. Srivastava, S. Kumar 2 and R.S. Parihar Sunrise University, Alwar, Rajsthan tomanishis@gmail.com 2 sanjeevis@yahoo.co.in Astract: We
More informationA metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions
1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =
More informationOrientation of manifolds - definition*
Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationInternational Journal of Pure and Applied Sciences and Technology
Int. J. Pure Appl. Sci. Technol., 2(2) (2011), pp. 66-74 International Journal of Pure and Applied Sciences and Technology ISSN 2229-6107 Available online at www.ijopaasat.in Research Paper Fuzzy Soft
More informationChapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces
Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs
More informationEndomorphisms and synchronization, 2: Graphs and transformation monoids. Peter J. Cameron
Endomorphisms and synchronization, 2: Graphs and transformation monoids Peter J. Cameron BIRS, November 2014 Relations and algebras From algebras to relations Given a relational structure R, there are
More informationEndomorphisms and synchronization, 2: Graphs and transformation monoids
Endomorphisms and synchronization, 2: Graphs and transformation monoids Peter J. Cameron BIRS, November 2014 Relations and algebras Given a relational structure R, there are several similar ways to produce
More informationPARTIALLY ORDERED SETS. James T. Smith San Francisco State University
PARTIALLY ORDERED SETS James T. Smith San Francisco State University A reflexive transitive relation on a nonempty set X is called a quasi-ordering of X. An ordered pair consisting of a nonempty
More informationAlternative Exponential Equations for. Rectangular Arrays of Four and Five Data
Applied Mathematical Sciences, Vol. 5, 2011, no. 35, 1733-1738 Alternative Exponential Equations for Rectangular Arrays of Four and Five Data G. L. Silver Los Alamos National Laboratory* P.O. Box 1663,
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationMA651 Topology. Lecture 4. Topological spaces 2
MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter
More informationCayley graphs and coset diagrams/1
1 Introduction Cayley graphs and coset diagrams Let G be a finite group, and X a subset of G. The Cayley graph of G with respect to X, written Cay(G, X) has two different definitions in the literature.
More informationChapter 2: FUZZY SETS
Ch.2: Fuzzy sets 1 Chapter 2: FUZZY SETS Introduction (2.1) Basic Definitions &Terminology (2.2) Set-theoretic Operations (2.3) Membership Function (MF) Formulation & Parameterization (2.4) Complement
More informationCurriculum Catalog
2017-2018 Curriculum Catalog 2017 Glynlyon, Inc. Table of Contents GEOMETRY COURSE OVERVIEW... 1 UNIT 1: INTRODUCTION... 1 UNIT 2: LOGIC... 2 UNIT 3: ANGLES AND PARALLELS... 2 UNIT 4: CONGRUENT TRIANGLES
More informationOn Soft Topological Linear Spaces
Republic of Iraq Ministry of Higher Education and Scientific Research University of AL-Qadisiyah College of Computer Science and Formation Technology Department of Mathematics On Soft Topological Linear
More informationInformation Granulation and Approximation in a Decision-theoretic Model of Rough Sets
Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More information8.B. The result of Regiomontanus on tetrahedra
8.B. The result of Regiomontanus on tetrahedra We have already mentioned that Plato s theory that the five regular polyhedra represent the fundamental elements of nature, and in supplement (3.D) to the
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationA fuzzy subset of a set A is any mapping f : A [0, 1], where [0, 1] is the real unit closed interval. the degree of membership of x to f
Algebraic Theory of Automata and Logic Workshop Szeged, Hungary October 1, 2006 Fuzzy Sets The original Zadeh s definition of a fuzzy set is: A fuzzy subset of a set A is any mapping f : A [0, 1], where
More informationBinary Ordering-Based Modifiers
Binary Ordering-Based Modifiers Ulrich Bodenhofer Software Competence Center Hagenberg A-4232 Hagenberg, Austria ulrich.bodenhofer@scch.at Abstract In continuation of research work on the unary ordering-based
More informationA TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3
A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F
More informationThe Inverse of a Schema Mapping
The Inverse of a Schema Mapping Jorge Pérez Department of Computer Science, Universidad de Chile Blanco Encalada 2120, Santiago, Chile jperez@dcc.uchile.cl Abstract The inversion of schema mappings has
More informationFUDMA Journal of Sciences (FJS) Maiden Edition Vol. 1 No. 1, November, 2017, pp ON ISOMORPHIC SOFT LATTICES AND SOFT SUBLATTICES
FUDMA Journal of Sciences (FJS) Maiden Edition Vol 1 No 1 November 2017 pp 28-34 ON ISOMORPHIC SOFT LATTICES AND SOFT SUBLATTICES * A O Yusuf 1 A M Ibrahim 2 1 Department of Mathematical Sciences Information
More informationSome fixed fuzzy point results using Hausdorff metric in fuzzy metric spaces
Annals of Fuzzy Mathematics and Informatics Volume 13, No 5, (May 017), pp 641 650 ISSN: 093 9310 (print version) ISSN: 87 635 (electronic version) http://wwwafmiorkr @FMI c Kyung Moon Sa Co http://wwwkyungmooncom
More informationNon-Standard Models of Arithmetic
Non-Standard Models of Arithmetic Asher M. Kach 1 May 2004 Abstract Almost everyone, mathematician or not, is comfortable with the standard model (N : +, ) of arithmetic. Less familiar, even among logicians,
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
More informationFUNDAMENTALS OF FUZZY SETS
FUNDAMENTALS OF FUZZY SETS edited by Didier Dubois and Henri Prade IRIT, CNRS & University of Toulouse III Foreword by LotfiA. Zadeh 14 Kluwer Academic Publishers Boston//London/Dordrecht Contents Foreword
More informationThe Best Interval Representation of Fuzzy S-Implications and Automorphisms
The Best Interval Representation of Fuzzy S-Implications and Automorphisms Benjamín C. Bedregal, Regivan H. N. Santiago, Renata H. S. Reiser, Graçaliz P. Dimuro Abstract The aim of this work is to analyze
More informationPartial Metrics and Quantale-valued Sets (Preprint)
Partial Metrics and Quantale-valued Sets (Preprint) Michael Bukatin 1 MetaCarta, Inc. Cambridge, Massachusetts, USA Ralph Kopperman 2 Department of Mathematics City College City University of New York
More informationOn Fuzzy Topological Spaces Involving Boolean Algebraic Structures
Journal of mathematics and computer Science 15 (2015) 252-260 On Fuzzy Topological Spaces Involving Boolean Algebraic Structures P.K. Sharma Post Graduate Department of Mathematics, D.A.V. College, Jalandhar
More informationGeometry. Course Requirements
Geometry Geometry is a full year, high school math course for the student who has successfully completed the prerequisite course, Algebra I. The course focuses on the skills and methods of linear, coordinate,
More informationREVIEW OF FUZZY SETS
REVIEW OF FUZZY SETS CONNER HANSEN 1. Introduction L. A. Zadeh s paper Fuzzy Sets* [1] introduces the concept of a fuzzy set, provides definitions for various fuzzy set operations, and proves several properties
More informationMATH 54 - LECTURE 10
MATH 54 - LECTURE 10 DAN CRYTSER The Universal Mapping Property First we note that each of the projection mappings π i : j X j X i is continuous when i X i is given the product topology (also if the product
More informationThis image cannot currently be displayed. Course Catalog. Pre-algebra Glynlyon, Inc.
This image cannot currently be displayed. Course Catalog Pre-algebra 2016 Glynlyon, Inc. Table of Contents COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS...
More informationPositive Definite Kernel Functions on Fuzzy Sets
Positive Definite Kernel Functions on Fuzzy Sets FUZZ 2014 Jorge Guevara Díaz 1 Roberto Hirata Jr. 1 Stéphane Canu 2 1 Institute of Mathematics and Statistics University of Sao Paulo-Brazil 2 Institut
More information2 A topological interlude
2 A topological interlude 2.1 Topological spaces Recall that a topological space is a set X with a topology: a collection T of subsets of X, known as open sets, such that and X are open, and finite intersections
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More informationCharacterization of Boolean Topological Logics
Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics Anthony R. Fressola Denison University Granville, OH 43023 University of Illinois Urbana-Champaign, IL USA 61801-61802
More informationAN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE 1.INTRODUCTION
Mathematical and Computational Applications, Vol. 16, No. 3, pp. 588-597, 2011. Association for Scientific Research AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE
More informationBase size and separation number
Base size and separation number Peter J. Cameron CSG notes, April 2005 Brief history The concept of a base for a permutation group was introduced by Sims in the 1960s in connection with computational group
More informationTHE -COMPOSITION OF INTUITIONISTIC FUZZY IMPLICATIONS: AN ALGEBRAIC STUDY OF POWERS AND FAMILIES
Volume 9, No. 1, Jan. - 2018 (Special ssue) nternational Journal of Mathematical Archive-9(1), 2018, 71-77 Available online through www.ijma.info SSN 2229 5046 THE -COMPOSTON OF NTUTONSTC FUZZY MPLCATONS:
More informationCurriculum Catalog
2017-2018 Curriculum Catalog 2017 Glynlyon, Inc. Table of Contents MATHEMATICS 800 FUNDAMENTALS COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS... 2 UNIT
More informationCurriculum Catalog
2018-2019 Curriculum Catalog Table of Contents MATHEMATICS 800 COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS... 3 UNIT 3: MODELING PROBLEMS WITH RATIONAL
More informationcorrelated to the Michigan High School Mathematics Content Expectations
correlated to the Michigan High School Mathematics Content Expectations McDougal Littell Algebra 1 Geometry Algebra 2 2007 correlated to the STRAND 1: QUANTITATIVE LITERACY AND LOGIC (L) STANDARD L1: REASONING
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationSome Properties of Intuitionistic. (T, S)-Fuzzy Filters on. Lattice Implication Algebras
Theoretical Mathematics & Applications, vol.3, no.2, 2013, 79-89 ISSN: 1792-9687 (print), 1792-9709 (online) Scienpress Ltd, 2013 Some Properties of Intuitionistic (T, S)-Fuzzy Filters on Lattice Implication
More informationarxiv: v1 [math.lo] 16 Mar 2008
arxiv:0803.2338v1 [math.lo] 16 Mar 2008 Interval valued (, q)-fuzzy filters of pseudo BL-algebras Jianming Zhan a,, Wies law A. Dudek b, Young Bae Jun c a Department of Mathematics, Hubei Institute for
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationTHE GROUP OF SYMMETRIES OF THE TOWER OF HANOI GRAPH
THE GROUP OF SYMMETRIES OF THE TOWER OF HANOI GRAPH SOEUN PARK arxiv:0809.1179v1 [math.co] 7 Sep 2008 Abstract. The Tower of Hanoi problem with k pegs and n disks has been much studied via its associated
More informationTHE DOLD-KAN CORRESPONDENCE
THE DOLD-KAN CORRESPONDENCE 1. Simplicial sets We shall now introduce the notion of a simplicial set, which will be a presheaf on a suitable category. It turns out that simplicial sets provide a (purely
More informationCOMPLETE METRIC ABSOLUTE NEIGHBORHOOD RETRACTS
COMPLETE METRIC ABSOLUTE NEIGHBORHOOD RETRACTS WIES LAW KUBIŚ Abstract. We characterize complete metric absolute (neighborhood) retracts in terms of existence of certain maps of CW-polytopes. Using our
More informationCorrelation of 2012 Texas Essential Knowledge and Skills (TEKS) for Mathematics to Moving with Math-by-Topic Level D Grade 8
Correlation of 2012 Texas Essential Knowledge and Skills (TEKS) for Mathematics to Moving with Math-by-Topic Level D Grade 8 8.1 Mathematical process standards. The student uses mathematical processes
More informationThis image cannot currently be displayed. Course Catalog. Geometry Glynlyon, Inc.
This image cannot currently be displayed. Course Catalog Geometry 2016 Glynlyon, Inc. Table of Contents COURSE OVERVIEW... 1 UNIT 1: INTRODUCTION... 1 UNIT 2: LOGIC... 1 UNIT 3: ANGLES AND PARALLELS...
More informationSome New Similarity Measures for Histograms
Some New Similarity Measures for Histograms Dietrich Van der Weken Mike Nachtegael Etienne Kerre Ghent University Fuzziness &Uncertainty Modelling Krijgslaan 28 (S9) 9000 Ghent, Belgium dietrich.vanderweken@ugent.be
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationTilings of the Euclidean plane
Tilings of the Euclidean plane Yan Der, Robin, Cécile January 9, 2017 Abstract This document gives a quick overview of a eld of mathematics which lies in the intersection of geometry and algebra : tilings.
More informationComplexity of unique list colorability
Complexity of unique list colorability Dániel Marx 1 Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest H-151, Hungary. Abstract Given a list
More informationCurriculum Catalog
2017-2018 Curriculum Catalog 2017 Glynlyon, Inc. Table of Contents GEOMETRY COURSE OVERVIEW...1 UNIT 1: INTRODUCTION... 1 UNIT 2: LOGIC... 1 UNIT 3: ANGLES AND PARALLELS... 2 UNIT 4: CONGRUENT TRIANGLES
More informationEXPLORE MATHEMATICS TEST
EXPLORE MATHEMATICS TEST Table 4: The College Readiness The describe what students who score in the specified score ranges are likely to know and to be able to do. The help teachers identify ways of enhancing
More informationSTABILITY AND PARADOX IN ALGORITHMIC LOGIC
STABILITY AND PARADOX IN ALGORITHMIC LOGIC WAYNE AITKEN, JEFFREY A. BARRETT Abstract. Algorithmic logic is the logic of basic statements concerning algorithms and the algorithmic rules of deduction between
More informationCURRICULUM CATALOG. Geometry ( ) TX
2018-19 CURRICULUM CATALOG Table of Contents GEOMETRY (03100700) TX COURSE OVERVIEW... 1 UNIT 1: INTRODUCTION... 1 UNIT 2: LOGIC... 1 UNIT 3: ANGLES AND PARALLELS... 2 UNIT 4: CONGRUENT TRIANGLES AND QUADRILATERALS...
More information3.7 Denotational Semantics
3.7 Denotational Semantics Denotational semantics, also known as fixed-point semantics, associates to each programming language construct a well-defined and rigorously understood mathematical object. These
More informationEstimating normal vectors and curvatures by centroid weights
Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National
More informationarxiv:submit/ [math.co] 9 May 2011
arxiv:submit/0243374 [math.co] 9 May 2011 Connectivity and tree structure in finite graphs J. Carmesin R. Diestel F. Hundertmark M. Stein 6 May, 2011 Abstract We prove that, for every integer k 0, every
More informationWhat is a Graphon? Daniel Glasscock, June 2013
What is a Graphon? Daniel Glasscock, June 2013 These notes complement a talk given for the What is...? seminar at the Ohio State University. The block images in this PDF should be sharp; if they appear
More informationOn Generalizing Rough Set Theory
On Generalizing Rough Set Theory Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca Abstract. This paper summarizes various formulations
More informationMining High Order Decision Rules
Mining High Order Decision Rules Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 e-mail: yyao@cs.uregina.ca Abstract. We introduce the notion of high
More information3.4 Deduction and Evaluation: Tools Conditional-Equational Logic
3.4 Deduction and Evaluation: Tools 3.4.1 Conditional-Equational Logic The general definition of a formal specification from above was based on the existence of a precisely defined semantics for the syntax
More informationFuzzy Transform for Practical Problems
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Fuzzy Transform for Practical Problems Martin Štěpnička Research report No. 114 2007 Submitted/to appear: Inteligentní systémy
More informationN-flips in 3-dimensional Small Cove Transformation Groups and Combinato. 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39:
Title N-flips in 3-dimensional Small Cove Transformation Groups and Combinato Author(s) NISHIMURA, Yasuzo Citation 数理解析研究所講究録別冊 = RIMS Kokyuroku Bessa (2013), B39: 137-148 Issue Date 2013-04 URL http://hdl.handle.net/2433/207819
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationSaint Patrick High School
Saint Patrick High School Curriculum Guide Department: Mathematics Grade and Level: 10 and 11 Class: Phoenix Geometry Term (Semester or Year): Year course Required Text: Additional Resources (i.e. texts,
More informationFormal Predicate Calculus. Michael Meyling
Formal Predicate Calculus Michael Meyling May 24, 2013 2 The source for this document can be found here: http://www.qedeq.org/0_04_07/doc/math/qedeq_formal_logic_v1.xml Copyright by the authors. All rights
More informationVague Congruence Relation Induced by VLI Ideals of Lattice Implication Algebras
American Journal of Mathematics and Statistics 2016, 6(3): 89-93 DOI: 10.5923/j.ajms.20160603.01 Vague Congruence Relation Induced by VLI Ideals of Lattice Implication Algebras T. Anitha 1,*, V. Amarendra
More informationCMSC Honors Discrete Mathematics
CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical
More informationVertical decomposition of a lattice using clique separators
Vertical decomposition of a lattice using clique separators Anne Berry, Romain Pogorelcnik, Alain Sigayret LIMOS UMR CNRS 6158 Ensemble Scientifique des Cézeaux Université Blaise Pascal, F-63 173 Aubière,
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationGergonne and Nagel Points for Simplices in the n-dimensional Space
Journal for Geometry and Graphics Volume 4 (2000), No. 2, 119 127. Gergonne and Nagel Points for Simplices in the n-dimensional Space Edwin Koźniewsi 1, Renata A. Górsa 2 1 Institute of Civil Engineering,
More informationCS 512, Spring 2017: Take-Home End-of-Term Examination
CS 512, Spring 2017: Take-Home End-of-Term Examination Out: Tuesday, 9 May 2017, 12:00 noon Due: Wednesday, 10 May 2017, by 11:59 am Turn in your solutions electronically, as a single PDF file, by placing
More informationPlanarity. 1 Introduction. 2 Topological Results
Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean
More informationDisjoint Support Decompositions
Chapter 4 Disjoint Support Decompositions We introduce now a new property of logic functions which will be useful to further improve the quality of parameterizations in symbolic simulation. In informal
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationMathematically Rigorous Software Design Review of mathematical prerequisites
Mathematically Rigorous Software Design 2002 September 27 Part 1: Boolean algebra 1. Define the Boolean functions and, or, not, implication ( ), equivalence ( ) and equals (=) by truth tables. 2. In an
More informationON DECOMPOSITION OF FUZZY BԐ OPEN SETS
ON DECOMPOSITION OF FUZZY BԐ OPEN SETS 1 B. Amudhambigai, 2 K. Saranya 1,2 Department of Mathematics, Sri Sarada College for Women, Salem-636016, Tamilnadu,India email: 1 rbamudha@yahoo.co.in, 2 saranyamath88@gmail.com
More informationAndrea Frosini Università di Firenze, Dipartimento di Sistemi e Informatica, Viale Morgagni, 65, 50134, Firenze, Italy,
PUM Vol 17 (2006), No 1 2, pp 97 110 n object grammar for the class of L-convex polyominoes ndrea Frosini Università di Firenze, Dipartimento di Sistemi e Informatica, Viale Morgagni, 65, 50134, Firenze,
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More information