between implicator and coimplicator integrals,
|
|
- Arleen Jenkins
- 6 years ago
- Views:
Transcription
1 Implicator coimplicator integrals Gert de Cooman Universiteit Gent Elektrische Energietechniek Technologiepark 9, 9052 Zwijnaarde, Belgium Bernard De Baets Universiteit Gent Toegepaste Wiskunde en Informatica Krijgslaan 281 S9, 9000 Gent, Belgium bstract We introduce study implicator coimplicator integrals, investigate their possible application in defining the possibility necessity of fuzzy sets. First, the definition properties of implicators coimplicators on bounded posets are discussed. Then, in analogy with the theory of seminormed semiconormed fuzzy integrals, implicator coimplicator integrals are defined. Next, we study the properties of these dual types of integrals. We uncover an interesting relationship between implicator coimplicator integrals, seminormed semiconormed fuzzy integrals, which could also be called conjunctor disjunctor integrals. Finally, we show that coimplicator implicator integrals can be used to extend the domain of possibility measures necessity measures from sets to fuzzy sets. 1 INTRODUCTION Seminormed semiconormed fuzzy integrals were introduced in 1986 by Suárez García Gil Álvarez [10] as generalizations of Sugeno s fuzzy integral [11]. They were generalized by De Cooman Kerre [7], who also showed that they are, in a sense, the most general types of integrals satisfying a number of desired properties, that they are very well suited for combination with possibility respectively necessity measures. s their name suggests, these integrals are respectively associated with triangular seminorms triangular semiconorms. In this paper, we introduce two other types of fuzzy integrals, associated with border implicators border coimplicators, show that they too are well suited for combination with possibility respectively necessity measures. 2 EXTENDED LOGICL OPERTORS In this section, we discuss the four basic extended logical operators on a bounded poset P,, with top 1 P bottom 0 P. More extensive results concerning conjunctors disjunctors can be found in [3, 6], concerning implicators in [2, 3], concerning coimplicators in [1]. decreasing unary operator N on P, is called a negator iff N 0 P = 1 P N 1 P = 0 P. strong negator N on P, is a permutation of P that satisfies α β N α N β, α β in P. Note that an involutive, decreasing transformation is a strong negator. n increasing binary operator O on P, is called a conjunctor iff O0 P, 1 P = O1 P, 0 P = 0 P O1 P, 1 P = 1 P, a disjunctor iff O0 P, 1 P = O1 P, 0 P = 1 P O0 P, 0 P = 0 P. ny conjunctor C satisfies C0 P, α = Cα, 0 P = 0 P, while any disjunctor D satisfies D1 P, α = Dα, 1 P = 1 P. This means that by definition the values of a conjunctor are fixed on two of the four borders ; similarly for a disjunctor, but on the opposite borders. Fixing the values on the remaining borders leads to t-seminorms t-semiconorms. Definition 1 n increasing binary operator O on P, is called a t-seminorm iff for any α in P, O1 P, α = Oα, 1 P = α; a t-semiconorm iff for any α in P, O0 P, α = Oα, 0 P = α. Clearly, a t-seminorm is a conjunctor a t- semiconorm a disjunctor. hybrid monotonous binary operator O on P, with decreasing first increasing second partial mappings is called an implicator iff O0 P, 0 P = O1 P, 1 P = 1 P O1 P, 0 P = 0 P, a coimplicator iff O0 P, 0 P = O1 P, 1 P = 0 P O0 P, 1 P = 1 P.
2 Implicators are extensions of the Boolean implication p q meaning that p is sufficient for q, while coimplicators are extensions of the Boolean coimplication p q meaning that p is not necessary for q. ny implicator I satisfies I0 P, α = Iα, 1 P = 1 P, while any coimplicator J satisfies J 1 P, α = J α, 0 P = 0 P. gain, we can say that the values of an implicator or coimplicator are fixed on two of the four borders. The behaviour on one of the remaining borders is of particular interest. The partial mapping I, 0 P of an implicator I clearly is a negator, is denoted by N I, i.e. N I α = Iα, 0 P, called the negator induced by I. Similarly, the partial mapping J, 1 P of a coimplicator J is a negator, is denoted by N J, i.e. N J α = J α, 1 P, called the negator induced by J. Fixing the values on the remaining border leads to border implicators border coimplicators. Definition 2 n implicator I on P, that satisfies I1 P, β = β, β P, is called a border implicator. coimplicator J on P, that satisfies J 0 P, β = β, β P, is called a border coimplicator. Consider a strong negator N a binary operator O on P,. The dual operator of O w.r.t. N is the binary operator D N [O] on P, defined by, for any α β in P : D N [O]α, β = N 1 ON α, N β. With O N we also associate two binary operators Λ N [O] N [O] on P, defined by, for any α β in P : Λ N [O]α, β = Oβ, N α N [O]α, β = ON β, α. These notions lead to interesting relationships between our four basic types of extended logical operators. Proposition 3 i Consider a t-seminorm T, then D N [T ] is a t- semiconorm Λ N [T ] is a border coimplicator. ii Consider a t-semiconorm S, then D N [S] is a t- seminorm Λ N [S] is a border implicator. iii Consider a border implicator I, then D N [I] is a border coimplicator. Moreover, N [I] is a t- semiconorm iff N I = N 1. iv Consider a border coimplicator J, then D N [J ] is a border implicator. Moreover, N [J ] is a t- seminorm iff N J = N 1. mapping f between complete lattices L, M, is called a complete meet-morphism iff for any nonempty subset of L, finf = inf f; a complete join-morphism iff for any nonempty subset of L, fsup = sup f; a complete dual meet-morphism iff for any nonempty subset of L, finf = sup f; a complete dual joinmorphism iff for any nonempty subset of L, fsup = inf f. Note that a strong negator on a complete lattice always is a complete dual meetmorphism a complete dual join-morphism. 3 IMPLICTOR ND COIMPLICTOR INTEGRLS In the rest of this paper, will denote an arbitrary universe of discourse, V a field of subsets of, with {, } V. By L, we denote a complete lattice, with top 1 L bottom 0 L. The meet of L, will be denoted by, its join by. Moreover, T is a t-seminorm, S a t-semiconorm, I a border implicator J a border coimplicator on L,. By v we denote a L, -confidence measure on, V, i.e., a V L-mapping that is increasing: B v vb, for any B in V. If N is a strong negator, then the V L-mapping v N, defined by v N = N 1 vco, V, is a L, -confidence measure on, V, called the dual confidence measure of v w.r.t. N. mapping from to L is also called a L, -fuzzy set in. The set of all these mappings is denoted by L. The partial order on L allows us to define a partial order on L as follows: for any h 1 h 2 in L, h 1 h 2 ω h 1 ω h 2 ω. For any element µ of L, we denote the constant {µ}-mapping by µ. For any subset of, its characteristic L-mapping is denoted by χ defined by χ ω = 1 L, ω χ ω = 0 L, ω co. Let h be a L-mapping let λ be an element of L. We define the cut set Sλ h = {ω hω λ} the dual cut set Dλ h = {ω hω λ} of h at level λ. h is called V-cut-measurable iff λ LSλ h V dually V-cut-measurable iff λ LDλ h V. Note that for any, the following statements are equivalent: χ is V-cut-measurable; χ is dually V-cut-measurable; V. We call a L-mapping s V-simple iff it has a finite range s = {s 1,..., s n } is V-measurable, i.e., D k = s 1 {s k } V, k = 1,..., n. It is easily verified that for any ω in : sω = inf n I n χ Dk ω, s k = sup J χ codk ω, s k. k=1 k=1
3 Inspired by these expressions, we associate two functionals γi v ; δv J ; with the L, -confidence measure v in the following way. If V s is a V-simple L-mapping, then, with obvious notations, γ v I; s = δ v J ; s = n inf k=1 Iv D k, s k sup n k=1 J v cod k, s k. In the stard way see also [7], we use these functionals to construct two new functionals which are defined for arbitrary L-mappings, not just for V-simple mappings. Definition 4 Let h be a L-mapping let be an element of V. Then I hdv = inf{γi; v s h s} is called the I-integral or implicator integral of h on ; J hdv = sup{δj v ; s s h} is called the J -integral or coimplicator integral of h on. The following theorems give explicit formulas for the calculation of implicator coimplicator integrals. Theorem 5 Let h be a L-mapping let be an element of V. Then I hdv = inf I v B, sup hω 1 J hdv = sup J v cob, inf hω. 2 Proof. We give the proof of 2. The proof of 1 is completely analogous. Consider an arbitrary B in V, let λ B = inf hω consider the V-simple mapping s B assuming the value λ B on B 0 L elsewhere. Clearly s B h, whence J hdv δv J ; s B = J v cob, inf hω, therefore J hdv sup J v cob, inf hω. Conversely, consider a V-simple mapping s with s h, then clearly, with obvious notations, s k inf ω Dk hω, therefore also J v cod k, s k J v cod k, inf ω Dk hω, k = 1,..., n. Therefore δj v ; s supn k=1 J v cod k, inf ω Dk hω sup J v cob, inf hω, whence J hdv sup J v cob, inf hω. Theorem 6 Let h be a L-mapping let be an element of V. If h is dually V-cut-measurable, then I hdv = inf Iv λ L Dh λ, λ. 3 If h is V-cut-measurable, then J hdv = sup J v cosλ, h λ. 4 λ L Proof. We give the proof of 3. The proof of 4 is analogous. ssume that h is dually V- cut-measurable. Consider an arbitrary B in V let λ B = sup hω. Clearly B Dλ h B, whence Iv Dλ h B, λ B Iv B, sup hω. Therefore, inf Iv λ L Dh λ, λ inf I v B, sup hω. Conversely, for λ in L, sup ω D h hω λ, whence λ I v Dλ h, sup ω D hω Iv D h h λ λ, λ. Therefore, inf Iv λ L Dh λ, λ inf I v B, sup hω. We continue with a number of interesting properties of implicator coimplicator integrals. Proposition 7 Let be an element of V. Then I χ dv = N I vco J χ dv = N J vco. Proof. We give the proof of the first equality. The other equality is proven analogously. Since χ is dually V-cut-measurable, we find that, using 3, I χ dv = inf λ L IvDχ λ, λ = Iv, 1 L inf Ivco, λ λ<1 L = Ivco, 0 L = N I vco.
4 Proposition 8 Let be an element of V let µ be an element of L. Then I µdv = N I v Iv, µ J µdv = N J v J v, µ. Proof. We give the proof of the second equality. The proof of the first equality is similar. Consider any λ in L. Since, for λ µ, S µ λ = for λ µ, Sµ λ =, µ is V-cut-measurable, therefore, using 4, J µdv = sup J v cos µ λ, λ λ L = sup J v, λ sup J v, λ λ µ { λ µ J v, 1L ; µ = 1 = L J v, µ J v, 1 L ; µ < 1 L = N J v J v, µ. s a corollary of this, we have for any in V that I 0 Ldv = N I v I 1 Ldv = N I v. lso, J 0 Ldv = N J v J 1 Ldv = N J v. Moreover, if µ is any element of L, we find that if v = 0 L, then I µdv = Iv, µ J µdv = N J v µ. If v = 1 L, then I µdv = N Iv µ J µdv = J v, µ. Finally, if both v = 0 L v = 1 L, then I µdv = J µdv = µ. The following proposition is an immediate consequence of Theorem 5. It shows that implicator coimplicator integrals are increasing in their integr but decreasing in their domain of integration, which is a somewhat undesirable property. Indeed, in [7] it was shown that the only integrals which have a selection of desired properties, among which isotonicity in the integration domain, are the seminormed semiconormed fuzzy integrals. It is therefore not surprising that these new integrals have a number of less desirable properties. We shall nevertheless see further on that, like seminormed semiconormed fuzzy integrals, they have a part to play in possibility theory. Proposition 9 Let, 1 2 be elements of V. Let h, h 1 h 2 be L-mappings. ssume that 1 2 h 1 h 2. Then I h 1dv I h 2dv J h 1dv J h 2dv. lso, I 1 hdv I 2 hdv J 1 hdv J 2 hdv. To end this section, we give a number of propositions relating implicator coimplicator integrals both to each other to seminormed semiconormed fuzzy integrals. For a detailed account of the latter, we refer to [7]. In the context of this paper, we merely point out that for the L, -fuzzy T -integral of a L-mapping h on a set V: T hdv = sup T inf hω, v B, for the L, -fuzzy S-integral of h on : S hdv = inf Ssup hω, v cob. Proposition 10 Let N be a strong negator on L, let h be a L-mapping. Then D N [I] hdv N = N 1 I N hdv D N [J ] hdv N = N 1 J N hdv. Proof. We prove the first equality. The proof of the second is similar. Since D N [I] is a border coimplicator on L,, Theorem 5 tells us that D N [I] hdv N = sup D N [I] v N cob, inf hω = sup N IN 1 v N cob, N inf hω = N 1 inf I vb, supn hω, which completes the proof. The proof of the next proposition is similar therefore omitted. Proposition 11 Let N be a strong negator on L, let h be a L-mapping. Then Λ N [T ] hdv N = T hdv Λ N [S] hdv N = S hdv. Moreover, if N I = N 1, then N [I] hdv N = I hdv, if N J = N 1, then N [J ] hdv N = J hdv,
5 4 POSSIBILITY ND NECESSITY OF FUZZY SETS Let us now consider an ample field R [5, 12] of subsets of, i.e., a class of subsets of that is closed under arbitrary unions under complementation. The atom [ω] R of R containing ω is the element of R defined by [ω] R = { R ω }. Note that for any, R = ω [ω] R. For any L-mapping h, the following statements are readily shown to be equivalent: h is R-cut-measurable; h is dually R-cut-measurable; h is constant on the atoms of R. Whenever h is constant on the atoms of R, we say that h is R-measurable. mapping Π from R to L is called a L, -possibility measure or simply possibility measure on, R iff for any family j j J of elements of R, Π j = sup Π j. Note that Π = 0 L. Π is called normal iff Π = 1 L. L-mapping π is called a distribution of Π iff it is constant on the atoms of R R-measurable if for any in R, Π = sup ω πω. Such a distribution is unique given by πω = Π[ω] R, ω. mapping N from R to L is called a L, -necessity measure or simply necessity measure on, R iff for any family j j J of elements of R, N j = inf N j. Note that N = 1 L. N is called normal iff N = 0 L. L-mapping ν is called a distribution of N iff it is constant on the atoms of R if for any in R, N = inf ω co νω. gain, such a distribution is unique. It is given by νω = Nco[ω] R, ω. For more information about possibility necessity measures, we refer to [4, 8, 9, 13] In this section, Π is a L, -possibility measure on, R, with distribution π; N is a L, -necessity measure on, R with distribution ν. Furthermore, for the border implicator I, we assume that its first partial mappings are complete dual join-morphisms that its second partial mappings are complete meet-morphisms. For the border coimplicator J, it will dually be assumed that its first partial mappings are complete dual meet-morphisms that its second partial mappings are complete join-morphisms. Note that this implies that N I is a complete dual joinmorphism N J a complete dual meet-morphism. The following results tell us what happens if we associate an implicator integral with Π, a coimplicator integral with N. Theorem 12 Let be an element of V let h be a L-mapping. Then I hdπ = inf I πω, sup hx ω x [ω] R J hdn = N J N sup J ω νω, inf hx. x [ω] R Proof. We give the proof of the second equality. The proof of the first equality is analogous, but somewhat less complicated. Since the first partial mappings of J are complete dual meet-morphisms, we find, taking into account Theorem 5, J hdn = sup J N cob, inf hx B R x B = sup J N inf νω, inf hx B R x B = N J N sup J inf νω, inf hx B R x B Since moreover it is easily verified that for µ L, J χ cob ω νω, µ = J νω, χ B ω µ, since the second partial mappings of J are complete join-morphisms, we find that sup J inf νω, inf hx B R x B = sup sup J χ cob ω νω, inf hx x B ω B R = sup J ω = sup J ω νω, sup χ B ω inf hx B R x B νω, inf, x [ω] R hx The following propositions give interesting expressions for implicator coimplicator integrals associated with possibility respectively necessity measures, when the integr is R-measurable. They immediately follow from the theorem above. Proposition 13 Let be an element of V let h be an R-measurable L-mapping. Then I hdπ = inf Iπω, hω ω J hdn = N J N sup J νω, hω. ω Proposition 14 Let h be an R-measurable L- mapping. Then I hdπ = inf Iπω, hω ω
6 J hdn = sup J νω, hω. ω Moreover, for any in R, J hdn = N J N J hdn. s a corollary of this proposition, we have for any R- simple L-mapping s that I sdπ = γπ I ; s J sdn = N J N δ N J ; s. Proposition 15 Let be an element of R let h j j J be a family of R-measurable L- mappings. Then inf h j sup h j are L- measurable. Moreover, I inf h jdπ = inf I h j dπ J sup h j dn = sup J h j dn. Proposition 16 Let j j J be a family of elements of R let h be a R-measurable L- mapping. Then I hdπ = inf I h j dπ j j J j hdn = sup J hdn. j In [7] it was shown that seminormed semiconormed fuzzy integrals can be used to extend the domain of possibility respectively necessity measures from measurable sets to measurable fuzzy sets. Propositions 7 15 tell us that something similar can be done with implicator coimplicator integrals. For any R-measurable L mapping h, define Π I h = I hdπ N J h = J hdn. Then clearly Π I is infimum preserving N J supremum preserving. Moreover, for any in R, Π I χ = N I Πco N J χ = N J Nco. n implicator integral therefore allows us to turn a possibility measure Π into an extended necessity measure Π I, dually, a coimplicator integral allows us to turn a necessity measure N into a possibility measure N J. If N I N J are strong negators, then Π I is the extension to fuzzy sets of the dual necessity measure Π N 1 of Π w.r.t. N 1 I I dually, N J is the extension to fuzzy sets of the dual possibility measure N N 1 J of N w.r.t. N 1 J. cknowledgements Gert de Cooman is a Postdoctoral Fellow of the Belgian National Fund for Scientific Research NFWO. He would like to thank the NFWO for partially funding the research reported on in this paper. References [1] B. De Baets. Coimplicators, the forgotten connectives. Tatra Mountains Math. Publ. submitted. [2] B. De Baets. Model implicators their characterization. In N. Steele, editor, Proceedings of the First ICSC International Symposium on Fuzzy Logic Zürich, Switzerl, May 26 27, 1995, pages ICSC cademic Press, [3] B. De Baets. Oplossen van vaagrelationele vergelijkingen: een ordetheoretische benadering [Solving fuzzy relational equations: an ordertheoretic approach]. PhD thesis, Universiteit Gent, in Dutch. [4] G. de Cooman. Possibility theory I III. International Journal of General Systems. in press. [5] G. de Cooman E. E. Kerre. mple fields. Simon Stevin, 67: , [6] G. de Cooman E. E. Kerre. Order norms on bounded partially ordered sets. The Journal of Fuzzy Mathematics, 2: , [7] G. de Cooman E. E. Kerre. Possibility necessity integrals. Fuzzy Sets Systems, 77: , [8] G. de Cooman, D. Ruan, E. E. Kerre, editors. Foundations pplications of Possibility Theory Proceedings of FPT 95, Ghent, Belgium, December 1995, Singapore, World Scientific. [9] D. Dubois H. Prade. Théorie des possibilités. Masson, Paris, [10] F. Suárez García P. Gil Álvarez. Two families of fuzzy integrals. Fuzzy Sets Systems, 18:67 81, [11] M. Sugeno. The Theory of Fuzzy Integrals Its pplications. PhD thesis, Tokyo Institute of Technology, Tokyo, [12] P.-Z. Wang. Fuzzy contactability fuzzy variables. Fuzzy Sets Systems, 8:81 92, [13] L.. Zadeh. Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Systems, 1:3 28, 1978.
G. de Cooman E. E. Kerre Universiteit Gent Vakgroep Toegepaste Wiskunde en Informatica
AMPLE FIELDS G. de Cooman E. E. Kerre Universiteit Gent Vakgroep Toegepaste Wiskunde en Informatica In this paper, we study the notion of an ample or complete field, a special case of the well-known fields
More informationFirst Results for a Mathematical Theory of Possibilistic Processes
First Results for a Mathematical heory of Possibilistic Processes H.J. Janssen, G. de Cooman and E.E. Kerre Universiteit Gent Vakgroep oegepaste Wiskunde en Informatica Krijgslaan 281, B-9000 Gent, Belgium
More informationGERT DE COOMAN AND DIRK AEYELS
POSSIBILITY MEASURES, RANDOM SETS AND NATURAL EXTENSION GERT DE COOMAN AND DIRK AEYELS Abstract. We study the relationship between possibility and necessity measures defined on arbitrary spaces, the theory
More informationPOSSIBILITY THEORY III POSSIBILISTIC INDEPENDENCE GERT DE COOMAN
POSSIBILITY THEORY III POSSIBILISTIC INDEPENDENCE GERT DE COOMAN Universiteit Gent, Vagroep Eletrische Energietechnie Technologiepar 9, B-9052 Zwijnaarde, Belgium. E-mail: gert.decooman@rug.ac.be Dedicated
More informationPOSSIBILITY THEORY I THE MEASURE- AND INTEGRAL-THEORETIC GROUNDWORK GERT DE COOMAN
POSSIBILITY THORY I TH MASUR- AND INTGRAL-THORTIC GROUNDWORK GRT D COOMAN Universiteit Gent, Vakgroep lektrische nergietechniek Technologiepark 9, B-9052 Zwijnaarde, Belgium. -mail: gert.decooman@rug.ac.be
More informationPractical implementation of possibilistic probability mass functions
Practical implementation of possibilistic probability mass functions Leen Gilbert Gert de Cooman Etienne E. Kerre October 12, 2000 Abstract Probability assessments of events are often linguistic in nature.
More informationPractical implementation of possibilistic probability mass functions
Soft Computing manuscript No. (will be inserted by the editor) Practical implementation of possibilistic probability mass functions Leen Gilbert, Gert de Cooman 1, Etienne E. Kerre 2 1 Universiteit Gent,
More information(T; N) and Residual Fuzzy Co-Implication in Dual Heyting Algebra with Applications
Preprints (www.preprints.org) O PEER-REVIEWED Posted: 3 August 2016 Article (; ) Residual Fuzzy Co-Implication in Dual Heyting Algebra with Applications Iqbal H. ebril Department of Mathematics cience
More informationNotes on Ordered Sets
Notes on Ordered Sets Mariusz Wodzicki September 10, 2013 1 Vocabulary 1.1 Definitions Definition 1.1 A binary relation on a set S is said to be a partial order if it is reflexive, x x, weakly antisymmetric,
More informationExtension of coherent lower previsions to unbounded random variables
Matthias C. M. Troffaes and Gert de Cooman. Extension of coherent lower previsions to unbounded random variables. In Proceedings of the Ninth International Conference IPMU 2002 (Information Processing
More informationEfficient Approximate Reasoning with Positive and Negative Information
Efficient Approximate Reasoning with Positive and Negative Information Chris Cornelis, Martine De Cock, and Etienne Kerre Fuzziness and Uncertainty Modelling Research Unit, Department of Applied Mathematics
More informationAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
Iranian Journal of Fuzzy Systems Vol. 9, No. 6, (2012) pp. 31-41 31 AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC E. ESLAMI Abstract. In this paper we extend the notion of degrees of membership
More informationA Complete Description of Comparison Meaningful Functions
A Complete Description of Comparison Meaningful Functions Jean-Luc MARICHAL Radko MESIAR Tatiana RÜCKSCHLOSSOVÁ Abstract Comparison meaningful functions acting on some real interval E are completely described
More informationLecture 4. Algebra, continued Section 2: Lattices and Boolean algebras
V. Borschev and B. Partee, September 21-26, 2006 p. 1 Lecture 4. Algebra, continued Section 2: Lattices and Boolean algebras CONTENTS 1. Lattices.... 1 1.0. Why lattices?... 1 1.1. Posets... 1 1.1.1. Upper
More informationMetrics and -Equalities
Journal of Mathematical Analysis and Applications 267, 531 547 (2002) doi:10.1006/jmaa.2001.7786, available online at http://www.idealibrary.com on Metrics and -Equalities Bernard De Baets Department of
More informationEVALUATION SETS AND MAPPINGS: THE ORDER-THEORETIC ASPECT OF THE MEANING OF PROPERTIES
EVALUATION SETS AND MAPPINGS: THE ORDER-THEORETIC ASPECT OF THE MEANING OF PROPERTIES Gert DE COOMAN Research Assistant N.F.S.R. Vakgroep Elektrische Energietechniek Universiteit Gent, Belgium Abstract
More informationChebyshev Type Inequalities for Sugeno Integrals with Respect to Intuitionistic Fuzzy Measures
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 2 Sofia 2009 Chebyshev Type Inequalities for Sugeno Integrals with Respect to Intuitionistic Fuzzy Measures Adrian I.
More informationDurham Research Online
Durham Research Online Deposited in DRO: 16 January 2015 Version of attached le: Accepted Version Peer-review status of attached le: Peer-reviewed Citation for published item: De Cooman, Gert and Troaes,
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationFuzzy Sets. Mirko Navara navara/fl/fset printe.pdf February 28, 2019
The notion of fuzzy set. Minimum about classical) sets Fuzzy ets Mirko Navara http://cmp.felk.cvut.cz/ navara/fl/fset printe.pdf February 8, 09 To aviod problems of the set theory, we restrict ourselves
More informationOrdinal aggregation and ranking
Ordinal aggregation and ranking Dieter Denneberg, Universität Bremen denneberg@math.uni-bremen.de October 2011 Abstract In applications often the scales of functions are not naturally embedded in the real
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationProof of Radon-Nikodym theorem
Measure theory class notes - 13 October 2010, class 20 1 Proof of Radon-Niodym theorem Theorem (Radon-Niodym). uppose Ω is a nonempty set and a σ-field on it. uppose µ and ν are σ-finite measures on (Ω,
More informationFuzzy relation equations with dual composition
Fuzzy relation equations with dual composition Lenka Nosková University of Ostrava Institute for Research and Applications of Fuzzy Modeling 30. dubna 22, 701 03 Ostrava 1 Czech Republic Lenka.Noskova@osu.cz
More informationFuzzy Modal Like Approximation Operations Based on Residuated Lattices
Fuzzy Modal Like Approximation Operations Based on Residuated Lattices Anna Maria Radzikowska Faculty of Mathematics and Information Science Warsaw University of Technology Plac Politechniki 1, 00 661
More informationDecomposition of the transitivity for additive fuzzy preference structures
Decomposition of the transitivity for additive fuzzy preference structures Susana Díaz, Susana Montes 1 Bernard De Baets 1.Dept. of Statistics and O.R., University of Oviedo Oviedo, Spain.Dept. of Applied
More informationCHARACTERIZATIONS OF L-CONVEX SPACES
Iranian Journal of Fuzzy Systems Vol 13, No 4, (2016) pp 51-61 51 CHARACTERIZATIONS OF L-CONVEX SPACES B PANG AND Y ZHAO Abstract In this paper, the concepts of L-concave structures, concave L- interior
More informationFURTHER DEVELOPMENT OF CHEBYSHEV TYPE INEQUALITIES FOR SUGENO INTEGRALS AND T-(S-)EVALUATORS
K Y BERNETIK VOLUM E 46 21, NUMBER 1, P GES 83 95 FURTHER DEVELOPMENT OF CHEBYSHEV TYPE INEQULITIES FOR SUGENO INTEGRLS ND T-S-EVLUTORS Hamzeh gahi, Radko Mesiar and Yao Ouyang In this paper further development
More informationAustralian Journal of Basic and Applied Sciences, 5(9): , 2011 ISSN Fuzzy M -Matrix. S.S. Hashemi
ustralian Journal of Basic and pplied Sciences, 5(9): 2096-204, 20 ISSN 99-878 Fuzzy M -Matrix S.S. Hashemi Young researchers Club, Bonab Branch, Islamic zad University, Bonab, Iran. bstract: The theory
More informationWhen does a semiring become a residuated lattice?
When does a semiring become a residuated lattice? Ivan Chajda and Helmut Länger arxiv:1809.07646v1 [math.ra] 20 Sep 2018 Abstract It is an easy observation that every residuated lattice is in fact a semiring
More informationAggregation and Non-Contradiction
Aggregation and Non-Contradiction Ana Pradera Dept. de Informática, Estadística y Telemática Universidad Rey Juan Carlos. 28933 Móstoles. Madrid. Spain ana.pradera@urjc.es Enric Trillas Dept. de Inteligencia
More informationA duality-theoretic approach to MTL-algebras
A duality-theoretic approach to MTL-algebras Sara Ugolini (Joint work with W. Fussner) BLAST 2018 - Denver, August 6th 2018 A commutative, integral residuated lattice, or CIRL, is a structure A = (A,,,,,
More informationLeft-continuous t-norms in Fuzzy Logic: an Overview
Left-continuous t-norms in Fuzzy Logic: an Overview János Fodor Dept. of Biomathematics and Informatics, Faculty of Veterinary Sci. Szent István University, István u. 2, H-1078 Budapest, Hungary E-mail:
More informationConcept lattices in fuzzy relation equations
Concept lattices in fuzzy relation equations Juan Carlos Díaz and Jesús Medina Department of Mathematics. University of Cádiz Email: {juancarlos.diaz,jesus.medina}@uca.es Abstract. Fuzzy relation equations
More informationContinuous R-implications
Continuous R-implications Balasubramaniam Jayaram 1 Michał Baczyński 2 1. Department of Mathematics, Indian Institute of echnology Madras, Chennai 600 036, India 2. Institute of Mathematics, University
More informationFUZZY relation equations were introduced by E. Sanchez
Position Papers of the Federated Conference on Computer Science and Information Systems pp. 19 23 DOI: 1.15439/216F564 ACSIS, Vol. 9. ISSN 23-5963 Computing the minimal solutions of finite fuzzy relation
More informationOn Generalization of Fuzzy Connectives
n Generalization of Fuzzy Connectives Imre J. Rudas udapest Tech Doberdó út 6, H-1034 udapest, Hungary rudas@bmf.hu bstract: In real applications of fuzzy logic the properties of aggregation operators
More informationFinite homogeneous and lattice ordered effect algebras
Finite homogeneous and lattice ordered effect algebras Gejza Jenča Department of Mathematics Faculty of Electrical Engineering and Information Technology Slovak Technical University Ilkovičova 3 812 19
More informationSome Pre-filters in EQ-Algebras
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 12, Issue 2 (December 2017), pp. 1057-1071 Applications and Applied Mathematics: An International Journal (AAM) Some Pre-filters
More informationRelations on Hypergraphs
Relations on Hypergraphs John Stell School of Computing, University of Leeds RAMiCS 13 Cambridge, 17th September 2012 Relations on a Set Boolean algebra Converse R = R Complement R = R Composition & residuation
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationAn Introduction to the Theory of Lattice
An Introduction to the Theory of Lattice Jinfang Wang Λy Graduate School of Science and Technology, Chiba University 1-33 Yayoi-cho, Inage-ku, Chiba 263-8522, Japan May 11, 2006 Λ Fax: 81-43-290-3663.
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More information2 Basic Results on Subtraction Algebra
International Mathematical Forum, 2, 2007, no. 59, 2919-2926 Vague Ideals of Subtraction Algebra Young Bae Jun Department of Mathematics Education (and RINS) Gyeongsang National University, Chinju 660-701,
More informationA Clear View on Quality Measures for Fuzzy Association Rules
A Clear View on Quality Measures for Fuzzy Association Rules Martine De Cock, Chris Cornelis, and Etienne E. Kerre Fuzziness and Uncertainty Modelling Research Unit Department of Applied Mathematics and
More informationMining Positive and Negative Fuzzy Association Rules
Mining Positive and Negative Fuzzy Association Rules Peng Yan 1, Guoqing Chen 1, Chris Cornelis 2, Martine De Cock 2, and Etienne Kerre 2 1 School of Economics and Management, Tsinghua University, Beijing
More informationGENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXV, 2(1996), pp. 247 279 247 GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS J. HEDLÍKOVÁ and S. PULMANNOVÁ Abstract. A difference on a poset (P, ) is a partial binary
More informationON FUZZY IDEALS OF PSEUDO MV -ALGEBRAS
Discussiones Mathematicae General Algebra and Applications 28 (2008 ) 63 75 ON FUZZY IDEALS OF PSEUDO MV -ALGEBRAS Grzegorz Dymek Institute of Mathematics and Physics University of Podlasie 3 Maja 54,
More informationKybernetika. Margarita Mas; Miquel Monserrat; Joan Torrens QL-implications versus D-implications. Terms of use:
Kybernetika Margarita Mas; Miquel Monserrat; Joan Torrens QL-implications versus D-implications Kybernetika, Vol. 42 (2006), No. 3, 35--366 Persistent URL: http://dml.cz/dmlcz/3579 Terms of use: Institute
More informationFuzzy logic Fuzzyapproximate reasoning
Fuzzy logic Fuzzyapproximate reasoning 3.class 3/19/2009 1 Introduction uncertain processes dynamic engineering system models fundamental of the decision making in fuzzy based real systems is the approximate
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationAveraging Operators on the Unit Interval
Averaging Operators on the Unit Interval Mai Gehrke Carol Walker Elbert Walker New Mexico State University Las Cruces, New Mexico Abstract In working with negations and t-norms, it is not uncommon to call
More informationarxiv:math/ v1 [math.gm] 21 Jan 2005
arxiv:math/0501341v1 [math.gm] 21 Jan 2005 SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, I. THE MAIN REPRESENTATION THEOREM MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P,
More informationNorm-induced partially ordered vector spaces
Stefan van Lent Norm-induced partially ordered vector spaces Bachelor thesis Thesis Supervisor: dr. O.W. van Gaans Date Bachelor Exam: 30th of June 016 Mathematisch Instituut, Universiteit Leiden Contents
More informationImprecise Bernoulli processes
Imprecise Bernoulli processes Jasper De Bock and Gert de Cooman Ghent University, SYSTeMS Research Group Technologiepark Zwijnaarde 914, 9052 Zwijnaarde, Belgium. {jasper.debock,gert.decooman}@ugent.be
More informationON ENDOMORPHISM MONOIDS OF PARTIAL ORDERS AND CENTRAL RELATIONS 1
Novi Sad J. Math. Vol. 38, No. 1, 2008, 111-125 ON ENDOMORPHISM MONOIDS OF PRTIL ORDERS ND CENTRL RELTIONS 1 Dragan Mašulović 2 bstract. In this paper we characterize pairs of Rosenberg s (ρ, σ) with the
More informationFUZZY ASSOCIATION RULES: A TWO-SIDED APPROACH
FUZZY ASSOCIATION RULES: A TWO-SIDED APPROACH M. De Cock C. Cornelis E. E. Kerre Dept. of Applied Mathematics and Computer Science Ghent University, Krijgslaan 281 (S9), B-9000 Gent, Belgium phone: +32
More informationDisjoint Variation, (s)-boundedness and Brooks-Jewett Theorems for Lattice Group-Valued k-triangular Set Functions
International Journal of Mathematical Analysis and Applications 2016; 3(3): 26-30 http://www.aascit.org/journal/ijmaa IN: 2375-3927 Disjoint Variation, (s)-boundedness and Brooks-Jewett Theorems for Lattice
More informationMax-min (σ-)additive representation of monotone measures
Noname manuscript No. (will be inserted by the editor) Max-min (σ-)additive representation of monotone measures Martin Brüning and Dieter Denneberg FB 3 Universität Bremen, D-28334 Bremen, Germany e-mail:
More informationSerena Doria. Department of Sciences, University G.d Annunzio, Via dei Vestini, 31, Chieti, Italy. Received 7 July 2008; Revised 25 December 2008
Journal of Uncertain Systems Vol.4, No.1, pp.73-80, 2010 Online at: www.jus.org.uk Different Types of Convergence for Random Variables with Respect to Separately Coherent Upper Conditional Probabilities
More informationEQ-algebras: primary concepts and properties
UNIVERSITY OF OSTRAVA Institute for Research and Applications of Fuzzy Modeling EQ-algebras: primary concepts and properties Vilém Novák Research report No. 101 Submitted/to appear: Int. Joint, Czech Republic-Japan
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationFuzzy Answer Set semantics for Residuated Logic programs
semantics for Logic Nicolás Madrid & Universidad de Málaga September 23, 2009 Aims of this paper We are studying the introduction of two kinds of negations into residuated : Default negation: This negation
More informationγ γ γ γ(α) ). Then γ (a) γ (a ) ( γ 1
The Correspondence Theorem, which we next prove, shows that the congruence lattice of every homomorphic image of a Σ-algebra is isomorphically embeddable as a special kind of sublattice of the congruence
More informationFinite pseudocomplemented lattices: The spectra and the Glivenko congruence
Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented
More informationCantor-Bendixson, socle, and atomicity H. Simmons
Cantor-Bendixson, socle, and atomicity H. Simmons The University, Manchester, England Harold.Simmons @ manchester.ac.uk This document is the second in the series [1] [7], concerned with the use of lattices
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationApplied Logic. Lecture 3 part 1 - Fuzzy logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 3 part 1 - Fuzzy logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018 1
More informationProperties of Boolean Algebras
Phillip James Swansea University December 15, 2008 Plan For Today Boolean Algebras and Order..... Brief Re-cap Order A Boolean algebra is a set A together with the distinguished elements 0 and 1, the binary
More informationA Non-Topological View of Dcpos as Convergence Spaces
A Non-Topological View of Dcpos as Convergence Spaces Reinhold Heckmann AbsInt Angewandte Informatik GmbH, Stuhlsatzenhausweg 69, D-66123 Saarbrücken, Germany e-mail: heckmann@absint.com Abstract The category
More informationRough Approach to Fuzzification and Defuzzification in Probability Theory
Rough Approach to Fuzzification and Defuzzification in Probability Theory G. Cattaneo and D. Ciucci Dipartimento di Informatica, Sistemistica e Comunicazione Università di Milano Bicocca, Via Bicocca degli
More informationFeature Selection with Fuzzy Decision Reducts
Feature Selection with Fuzzy Decision Reducts Chris Cornelis 1, Germán Hurtado Martín 1,2, Richard Jensen 3, and Dominik Ślȩzak4 1 Dept. of Mathematics and Computer Science, Ghent University, Gent, Belgium
More informationInterval based Uncertain Reasoning using Fuzzy and Rough Sets
Interval based Uncertain Reasoning using Fuzzy and Rough Sets Y.Y. Yao Jian Wang Department of Computer Science Lakehead University Thunder Bay, Ontario Canada P7B 5E1 Abstract This paper examines two
More informationFuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras
Fuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras Jiří Rachůnek 1 Dana Šalounová2 1 Department of Algebra and Geometry, Faculty of Sciences, Palacký University, Tomkova
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationTowards Formal Theory of Measure on Clans of Fuzzy Sets
Towards Formal Theory of Measure on Clans of Fuzzy Sets Tomáš Kroupa Institute of Information Theory and Automation Academy of Sciences of the Czech Republic Pod vodárenskou věží 4 182 08 Prague 8 Czech
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More informationGENERAL AGGREGATION OPERATORS ACTING ON FUZZY NUMBERS INDUCED BY ORDINARY AGGREGATION OPERATORS
Novi Sad J. Math. Vol. 33, No. 2, 2003, 67 76 67 GENERAL AGGREGATION OPERATORS ACTING ON FUZZY NUMBERS INDUCED BY ORDINARY AGGREGATION OPERATORS Aleksandar Takači 1 Abstract. Some special general aggregation
More informationOPPA European Social Fund Prague & EU: We invest in your future.
OPPA European Social Fund Prague & EU: We invest in your future. AE4M33RZN, Fuzzy logic: Introduction, Fuzzy operators Radomír Černoch 19/11/2012 Faculty of Electrical Engineering, CTU in Prague 1 / 44
More informationBL-Functions and Free BL-Algebra
BL-Functions and Free BL-Algebra Simone Bova bova@unisi.it www.mat.unisi.it/ bova Department of Mathematics and Computer Science University of Siena (Italy) December 9, 008 Ph.D. Thesis Defense Outline
More informationROUGHNESS IN MODULES BY USING THE NOTION OF REFERENCE POINTS
Iranian Journal of Fuzzy Systems Vol. 10, No. 6, (2013) pp. 109-124 109 ROUGHNESS IN MODULES BY USING THE NOTION OF REFERENCE POINTS B. DAVVAZ AND A. MALEKZADEH Abstract. A module over a ring is a general
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationUncertain Logic with Multiple Predicates
Uncertain Logic with Multiple Predicates Kai Yao, Zixiong Peng Uncertainty Theory Laboratory, Department of Mathematical Sciences Tsinghua University, Beijing 100084, China yaok09@mails.tsinghua.edu.cn,
More informationMathematical Morphology on Hypergraphs: Preliminary Definitions and Results
Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results Isabelle Bloch, Alain Bretto DGCI 2011 I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI
More informationSeminar Introduction to Fuzzy Logic I
Seminar Introduction to Fuzzy Logic I Itziar García-Honrado European Centre for Soft-Computing Mieres (Asturias) Spain 05/04/2011 Itziar García-Honrado (ECSC) Fuzzy Logic 05/04/2011 1 / 50 Figure: Crisp
More informationResearch Article General Fritz Carlson s Type Inequality for Sugeno Integrals
Hindawi Publishing Corporation Journal of Inequalities and pplications Volume, rticle ID 7643, 9 pages doi:.55//7643 Research rticle General Fritz Carlson s Type Inequality for Sugeno Integrals Xiaojing
More informationSome consequences of compactness in Lukasiewicz Predicate Logic
Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic
More information2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 12 Partially Ordered Sets Lattices Bounded Lattices Distributive Lattices Complemented Lattices
More informationNonlinear Optimization Subject to a System of Fuzzy Relational Equations with Max-min Composition
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 1 9 Nonlinear Optimization Subject to
More informationCompenzational Vagueness
Compenzational Vagueness Milan Mareš Institute of information Theory and Automation Academy of Sciences of the Czech Republic P. O. Box 18, 182 08 Praha 8, Czech Republic mares@utia.cas.cz Abstract Some
More informationAE4M33RZN, Fuzzy logic: Introduction, Fuzzy operators
AE4M33RZN, Fuzzy logic: Introduction, Fuzzy operators Radomír Černoch Faculty of Electrical Engineering, CTU in Prague 2/11/2015 Description logics A description logic is a decideable fragment of first
More informationMV-algebras and fuzzy topologies: Stone duality extended
MV-algebras and fuzzy topologies: Stone duality extended Dipartimento di Matematica Università di Salerno, Italy Algebra and Coalgebra meet Proof Theory Universität Bern April 27 29, 2011 Outline 1 MV-algebras
More informationEQUIVALENCE RELATIONS AND OPERATORS ON ORDERED ALGEBRAIC STRUCTURES. UNIVERSITÀ DEGLI STUDI DELL'INSUBRIA Via Ravasi 2, Varese, Italy
UNIVERSITÀ DEGLI STUDI DELL'INSUBRIA Via Ravasi 2, 21100 Varese, Italy Dipartimento di Scienze Teoriche e Applicate Di.S.T.A. Dipartimento di Scienza e Alta Tecnologia Di.S.A.T. PH.D. DEGREE PROGRAM IN
More informationAtomic effect algebras with compression bases
JOURNAL OF MATHEMATICAL PHYSICS 52, 013512 (2011) Atomic effect algebras with compression bases Dan Caragheorgheopol 1, Josef Tkadlec 2 1 Department of Mathematics and Informatics, Technical University
More informationON SOME BASIC CONSTRUCTIONS IN CATEGORIES OF QUANTALE-VALUED SUP-LATTICES. 1. Introduction
Math. Appl. 5 (2016, 39 53 DOI: 10.13164/ma.2016.04 ON SOME BASIC CONSTRUCTIONS IN CATEGORIES OF QUANTALE-VALUED SUP-LATTICES RADEK ŠLESINGER Abstract. If the standard concepts of partial-order relation
More informationSynthetic Computability
Synthetic Computability Andrej Bauer Department of Mathematics and Physics University of Ljubljana Slovenia MFPS XXIII, New Orleans, April 2007 What is synthetic mathematics? Suppose we want to study mathematical
More informationSemantics of intuitionistic propositional logic
Semantics of intuitionistic propositional logic Erik Palmgren Department of Mathematics, Uppsala University Lecture Notes for Applied Logic, Fall 2009 1 Introduction Intuitionistic logic is a weakening
More informationarxiv:math/ v1 [math.lo] 5 Mar 2007
Topological Semantics and Decidability Dmitry Sustretov arxiv:math/0703106v1 [math.lo] 5 Mar 2007 March 6, 2008 Abstract It is well-known that the basic modal logic of all topological spaces is S4. However,
More information