On varieties generated by Weak Nilpotent Minimum t-norms

Size: px
Start display at page:

Download "On varieties generated by Weak Nilpotent Minimum t-norms"

Transcription

1 On varieties generated by Weak Nilpotent Minimum t-norms Carles Noguera IIIA-CSIC Francesc Esteva IIIA-CSIC Joan Gispert Universitat de Barcelona Abstract In this paper we study Weak Nilpotent Minimum t-norms and their associated algebraic structures, the standard WNM-chains. We classify all the varieties generated by one standard WNM-chain, obtaining all the axiomatic extensions of WNM logic that are complete with respect to the semantics given by a left-continuous t-norm. To this end, we dene a set of canonical standard WNMchains and we prove that they generate pairwise dierent varieties and there are no other varieties generated by a standard WNM-chain. Keywords: Fuzzy logics, Left-continuous t- norms, Nilpotent Minimum Logic, MTL-algebras, NM-algebras, Residuated lattices, Varieties, Weak Nilpotent Minimum Logic, Non-classical logics, WNM-algebras. 1 Introduction In the foundational paper of Fuzzy Sets [7], Zadeh uses the t-norm of the minimum to deal with intersection. Fodor dened in [3] a left-continuous but non-continuous t-norm NM that he called Nilpotent Minimum t-norm (combining minimum with an involutive negation) dened by: minfa; bg if a > 1 b; a NM b = 0 otherwise: The associated negation function is n(a) = 1 a, i.e. the standard involutive negation. Esteva and Godo generalized Fodor's construction in [2] using any (possibly non-involutive) weak negation function to dene what they called Weak Nilpotent Minimum t-norms. Namely, given a weak 866 negation function n, they dened the corresponding t-norm n as: minfa; bg if a > n(b); a n b = 0 otherwise: for every a; b 2 [0; 1]. This is a generalization of both Zadeh's and Fodor's approaches by allowing any negation function. Moreover, in the same paper new fuzzy logics, Nilpotent Minimum logic and Weak Nilpotent Minimum logic (NM and WNM respectively, for short) were dened in order to capture the semantics given by Fodor's t-norm and by all Weak Nilpotent Minimum t-norms respectively. They also proposed an algebraic semantics for those logics based on the so-called NM-algebras 1 and WNM-algebras, particular kinds of residuated lattices. These classes of algebras contain, of course, those dened by a t-norm, which are called standard NM-algebras and standard WNMalgebras respectively. There is up to isomorphism only one standard NM-algebra, the one dened by Fodor's t-norm, but this is not the case of standard WNMalgebras. Indeed there are innitely-many nonisomorphic WNM-algebras given by Weak Nilpotent t-norms. In this paper we aim to classify them attending to the logic that they dene or equivalently to the variety of WNM-algebras that they generate. We begin with some necessary algebraic and logical preliminaries. Then we dene several kinds of weak negation functions obtaining thus several families of standard WNM-algebras; 1 The lattice of varieties of NM-algebras is fully described in [4].

2 we consider the varieties of WNM-algebras generated by them. This yields a complete classi- cation of all varieties generated by a standard WNM-algebra. Due to the lack of space the results are presented here without proofs. The detailed version will be available in a forthcoming paper. 2 Preliminaries WNM is the logic introduced by Esteva and Godo in [2] by means of a Hilbert style calculus in the language L = f ;!; ^; 0g of type (2; 2; 2; 0), where the only inference rule is Modus Ponens and the axiom schemata are the following (taking! as the least binding connective): (A1) ('! )! ((! )! ('! )) (A2) '! ' (A3) '! ' (A4) ' ^! ' (A5) ' ^! ^ ' (A6) ' ('! )! ' ^ (A7a) ('! (! ))! ('! ) (A7b) ('! )! ('! (! )) (A8) (('! )! )! (((! ')! )! ) (A9) 0! ' (A10) :(' ) _ (' ^! ' ) being : and _ the following dened connectives: :' := '! 0; ' _ := (('! )! ) ^ ((! ')! '). We denote the set of L-formulas built over a countable set of variables by F m L. Given [ f'g F m L we write `W NM ' if, and only if, ' is provable from in the system WNM. NM logic is the axiomatic extension of WNM by adding the axiom ::'! ' (involution). As is proved in [2], algebraic semantics for those logics are given by the classes of WNM-algebras and NM-algebras. Denition 1 ([2]). Let A = ha; ;!; ^; _; 0; 1i be an algebra of type (2; 2; 2; 2; 0; 0). We dene a unary operation by :a := a! 0. Then, A is a WNM-algebra if, and only if, it is a bounded residuated lattice satisfying the following equations: (x! y) _ (y! x) 1; :(x y) _ (x ^ y! x y) 1: A is a NM-algebra if, and only if, in addition saties the equation of involution: ::x x. An element a 2 A is positive (resp. negative) w.r.t. lattice order if a > :a (resp. a :a). We will say that A is a WNM-chain (resp. NMchain) if the lattice order is total, and we will say that the chain is standard if A = [0; 1]. We will denote by WNM and NM the classes of WNM-algebras and NM-algebras, respectively. It can proved that both classes are varieties and, of course, NM WNM. Recall from [2] that the operation in standard WNM-chains is given by a special kind of leftcontinuous t-norm. These t-norms are dened in the following way. If n is a negation function (see [1]) and a; b 2 [0; 1], the operation n is dened as: minfa; bg if a > n(b); a n b = 0 otherwise: n is a left-continuous t-norm and its residuum is given by: 1 if a b; a! n b = maxfn(a); bg otherwise: for every a; b 2 [0; 1]. It is straightfoward that [0; 1] n := h[0; 1]; n ;! n ; min; max; 0; 1i is a WNM-chain, and all WNM-chains over [0; 1] are of this form. Notice that a standard WNM-chain given by a negation function n is an NM-chain if, and only if, n is involutive, i.e. n(n(a)) = a for every a 2 [0; 1]. It follows from the study of such negations in [6] that there is only one standard NM-chain up to isomorphism, namely the one given by the negation n(x) = 1 x. We will refer to it as [0; 1] NM. Standard algebras provide a semantics for WNM and NM logics. This result is known as strong standard completeness theorem: Theorem 1 ([2]). Let [f'g F m L be a (possibly innite) set of formulas. Then: `W NM ' if, and only if, [0;1] n ' for every negation function n. `NM ' if, and only if, [0;1]NM '. This theorem has these interesting algebraic consequences: V([0; 1] NM ) = NM) and V(f[0; 1] n : n is a negation functiong) = WNM). 867

3 We need also to recall some properties of the negation operation in WNM-chains. 2 Lemma 1. Let A be a WNM-chain. every a 2 A: Then for (i) :a = :::a, (ii) a ::a, (iii) a = ::a if, and only if, there is b 2 A such that a = :b, and (iv) ::a = minfb 2 A : a b and b = ::bg. The last one gives rise to the following notation: Denition 2. Let A be a WNM-chain and a 2 A an involutive element. We dene I a := fb 2 A : ::b = ag and we call it the interval associated to a. We say that a has a trivial associated interval when I a = fag; in this case we also say that a is an isolated involutive element. 3 Main results Given a class K of algebras, K fin will denote the class of its nite members. Proposition 1. Let A and B be WNM-chains. Then, V(A) V(B) if, and only if, IS(A) fin IS(B) fin. In particular, we obtain that two standard WNMchains generate the same variety if, and only if, they have the same (up to isomorphism) nite subalgebras. This will be the criterion to give a classication of all varieties generated by a standard WNM-chain. Recall that those chains essentially depend only on a weak negation function. Therefore, taking into account the possible forms of those weak negation functions we will obtain the desired classication. Denition 3. Given a weak negation function, f, consider a non-isolated involutive point a 2 [0; 1] and its non-trivial associated interval I a. We say that I a is of type 1 if a is a discontinuity point of f, otherwise we say that I a is of type 2. Lemma 2. Let f be a weak negation function and a 2 [0; 1] a non-isolated involutive point. Then the following are equivalent: I a is of type 1. :a is non-isolated. 2 All the relevant properties of negations in MTL-chains can be found in the appendix of [2]. 868 I :a is of type 1. First we dene negation functions with a nite number of intervals: Denition 4. (i) Given n 2! n f0g, m 1 ; m 2 2! (with n = m 1 + m 2 ) and t 0 ; : : : ; t m1 ; s 0 ; : : : ; s m2 2 f0; 1g, we dene h n;m 1;m 2 as a weak negation function ;:::;sm 2 such that it has m 1 intervals in the negative part with t 0 isolated involutive elements before the rst one, t m isolated involutive elements after the last one and t i isolated involutive elements between the i-th and the (i+1)-th interval; and there are m 2 intervals in the positive part with s 0 isolated involutive elements before the rst one, s m isolated involutive elements after the last one and s i isolated involutive elements between the i-th and the (i + 1)-th interval. The associated standard WNM-chain is B n;m 1;m 2. ;:::;sm 2 And now we dene negation functions with an innite number of intervals: Denition 5. Given m 2! and t 0 ; : : : ; t m ; s 0 ; : : : ; s m 2! [ f1g, we dene the following weak negation functions: (ii) f 2m that it has no xpoint, it has m intervals of type 1 in the negative part with t 0 intervals of type 2 before the rst one, t m intervals of type 2 after the last one and t i intervals of type 2 type 1; and there are m intervals of type 1 in the positive part with s 0 intervals of type 2 before the rst one, s m intervals of type 2 after the last one and s i intervals of type 2 type 1, and I 1 = f1g. (iii) f 2m that it has no xpoint, it has m intervals of type 1 in the negative part with t 0 intervals of type 2 before the rst one, t m intervals of type 2 after the last one and t i intervals of type 2 type 1; and there are m intervals of type 1 in the positive part with s 0 intervals of type 2 before the rst one, s m intervals of type 2

4 after the last one and s i intervals of type 2 type 1, and I 1 6= f1g. (iv) g 2m that it has a xpoint which is isolated, it has m intervals of type 1 in the negative part with (i + 1)-th interval of type 1, and I 1 = f1g. (v) g 2m that it has a xpoint which is isolated, it has m intervals of type 1 in the negative part with (i + 1)-th interval of type 1, and I 1 6= f1g. (vi) g 2m+1 that it has a xpoint c which is non-isolated, there are m intervals of type 1 in the negative part whose right extreme is not c, with (i + 1)-th interval of type 1, and I 1 = f1g. (vii) g 2m+1 that it has a xpoint c which is non-isolated, there are m intervals of type 1 in the negative part whose right extreme is not c, with (i + 1)-th interval of type 1, and I 1 6= f1g. (viii) f 1 that it has no xpoint, it has intervals [0; a] and [f 1 (a); 1] of isolated involutive elements, it has! intervals of type 1 in the negative part and! intervals of type 1 in the positive part and nothing else. (ix) f 1 that it has no xpoint, it has! intervals of type 1 in the negative part and! intervals of type 1 in the positive part and nothing else. (x) g 1 that it has a xpoint c which is isolated, it has intervals [0; a], [g 1 (a); 1] and [d; g 1 (d)] (with d < c < g 1 (d)) of isolated involutive elements, it has! intervals of type 1 in the negative part and! intervals of type 1 in the positive part and nothing else. (xi) g 1 that it has a xpoint c which is isolated, it has an interval [d; g 1 (d)] (with d < c < g 1 (d)) of isolated involutive elements, it has! intervals of type 1 in the negative part and! intervals of type 1 in the positive part and nothing else. (xii) g 1+1 that it has a xpoint c which is non-isolated, it has intervals [0; a] and [g 1+1 (a); 1] of isolated involutive elements,it has! intervals of type 1 in the negative part and! intervals of type 1 in the positive part and nothing else. (xiii) g 1+1 that it has a xpoint c which is non-isolated, it has! intervals of type 1 in the negative part and! intervals of type 1 in the positive part and nothing else. The standard WNM-algebras dened by those weak negation functions will be denoted respectively by C 2m, C2m, D 2m, D2m, D2m+1, 869

5 D 2m+1, C1, C 1, D 1, D 1, D 1+1 and D 1+1. We call them canonical standard WNMchains. Min 0 0 Figure 1: Two examples of canonical standard WNM-chains: B 3;2;1 1;1;0;1;1 and D1+1. Theorem 2. Let A be a standard WNM-chain. Then: 1. If all the elements are involutive, then A = [0; 1] NM and V(A) = NM. 2. Suppose that A has an nite number n 2! n f0g of non-isolated involutive elements. Let m 1 be the number of intervals in the negative part and let m 2 be the number of intervals in the positive part. Then, there are t 0 ; : : : ; t m1 ; s 0 ; : : : ; s m2 2 f0; 1g such that A = B n;m 1;m 2 t 0 ;1;t 1 ;1:::;tm 1 ;s 0 ;1;s 1, and of ;1;:::;sm 2 course, V(A) = V(B n;m 1;m 2 ). ;:::;sm 2 3. Suppose that A has an innite number of non-isolated involutive elements but the number of intervals of type 1 is nite. Let m 2! be the number of intervals of type 1 in the positive part Suppose that A has no negation xpoint. It has m intervals of type 1 in the negative part. Then, there are t 0 ; : : : ; t m ; s 0 ; : : : ; s m 2! such that: if I 1 = f1g, then V(A) = V(Ct 2m 0 ;:::;tm;s 0 ;:::;sm ) if I 1 6= f1g, then V(A) = V(C 2m ) Suppose that A has a negation xpoint which is isolated. It has m intervals of c Min 870 type 1 in the negative part. Then, there are t 0 ; : : : ; t m ; s 0 ; : : : ; s m 2! such that: if I 1 = f1g, then V(A) = V(D 2m ) if I 1 6= f1g, then V(A) = V(D 2m ) Suppose that A has a negation xpoint c which is non-isolated. It has m intervals of type 1 in the negative part whose right extreme is not c. Then, there are t 0 ; : : : ; t m ; s 0 ; : : : ; s m 2! such that: if I 1 = f1g, then V(A) = V(D 2m+1 ) if I 1 6= f1g, then V(A) = V(D 2m+1 ). 4. Suppose that A has an innite number of intervals of type Suppose that A has no negation xpoint if I 1 = f1g, then V(A) = V(C 1 ) if I 1 6= f1g, then V(A) = V(C 1 ) Suppose that A has a negation xpoint which is isolated if I 1 = f1g, then V(A) = V(D 1 ) if I 1 6= f1g, then V(A) = V(D 1 ) Suppose that A has a negation xpoint which is not isolated if I 1 = f1g, then V(A) = V(D 1+1 ) if I 1 6= f1g, then V(A) = V(D 1+1 ). Moreover, all canonical standard WNM-chains generate pairwise dierent varieties. In [5] the subvarieties BP 0, BP +1 0 of MTL are studied and axiomatized. Inside WNM we obtain the following: WNM \ BP 0 is the variety generated by all WNM-chains without negation xpoint and it is axiomatized by: (:(:x) 2 ) 2 $ :(:x 2 ) 2 1. WNM \ BP +1 0 is the variety generated by all WNM-chains with an isolated negation xpoint and it is axiomatized by: 1. (:(:x) 2 ) 2 $ :(:x 2 ) 2 _ (:x $ ::x) 1,

6 2. (x _ :x! y _ :y) _ ((y _ :y! :y ^ ::y)! y_:y)_(((x_:x) 2! y_:y)! y _ :y) 1. Therefore, by Proposition 1 we obtain: V(C 1 ) = WNM \ BP 0, V(D 1 ) = WNM \ BP +1 0 and V(D 1+1 ) = WNM. Finally, we study the relations of inclusion between these varieties. Proposition 2. Let A be a canonical standard WNM-chain. Then: If A has no xpoint, then V(A) V(C 1 ). If A either has no xpoint or the xpoint is isolated, then V(A) V(D 1 ). V(A) V(D 1+1 ). Proposition 3. Let A and A 0 be canonical standard WNM-chains both dened from a negation function of type (i), (ii), (iii), (iv), (v), (vi) or (vii). Then, V(A) V(A 0 ) if, and only if, A 2 IS(A 0 ). Therefore, given two canonical standard WNMchains dened from a negation of the same type it is easy to check whether there is some inclusion between the varieties generated by them. To compare the varieties generated by chains de- ned from negations of dierent type, we use again Proposition 1 and the following criteria: Proposition 4. Let A and A 0 be canonical standard WNM-chains dened from negations of different type. Then: If A 0 has a nite number of non-isolated involutive elements (i.e. its negation is of type (i)) and A has an innite number of nonisolated involutive elements, then V(A) 6 V(A 0 ). If A 0 has I 1 = f1g and A has I 1 6= f1g, then V(A) 6 V(A 0 ). 4 Concluding remarks By dening a collection of canonical standard WNM-chains, we have classied all the varieties generated by one standard WNM-chain. Some of them have been identied and axiomatized. In a forthcoming paper we will give equational bases for all varieties generated by a nite family of WNM-chains with nitely-many non-isolated involutive points, so, in particular, we can axiomatize the varieties of the form V(B n;m 1;m 2 ). ;:::;sm 2 Nevertheless, the axiomatization of the remaining varieties studied here is still an open problem. Acknowledgments The authors acknowledge partial support of the Spanish projects TIN C03-01, TIN C03-02 and MTM and the Catalan project 2001SGR-0017 of DGR. References [1] F. Esteva, X. Domingo. Sobre negaciones fuertes y debiles en [0; 1], Stochastica 4 (1980) 141{166. [2] F. Esteva and L. Godo. Monoidal t- norm based Logic: Towards a logic for leftcontinuous t-norms, Fuzzy Sets and Systems 124 (2001) 271{288. [3] J. Fodor. Nilpotent minimum and related connectives for fuzzy logic. Proc. of FUZZ{ IEEE'95, 1995, pp. 2077{2082. [4] J. Gispert. Axiomatic extensions of the nilpotent minimum logic, Reports on Mathematical Logic 37 (2003) 113{123. [5] C. Noguera, F. Esteva and J. Gispert. On some varieties of MTL-algebras, To appear in Logic Journal of IGPL. [6] E. Trillas. Sobre funciones de negacion en la teora de conjuntos difusos, Stochastica 3 (1979) 47{60. [7] L. A. Zadeh. Fuzzy sets, Inform. Control 8 (1965) 338{353. If A 0 has no xpoint and A has xpoint, then V(A) 6 V(A 0 ). If A 0 has an isolated xpoint and A has a non-isolated xpoint, then V(A) 6 V(A 0 ). 871

DE MORGAN TRIPLES REVISITED

DE MORGAN TRIPLES REVISITED DE MORGAN TRIPLES REVISITED Francesc Esteva, Lluís Godo IIIA - CSIC, 08913 Bellaterra, Spain, {esteva,godo}@iiia.csic.es Abstract In this paper we overview basic nown results about the varieties generated

More information

Left-continuous t-norms in Fuzzy Logic: an Overview

Left-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 information

A note on fuzzy predicate logic. Petr H jek 1. Academy of Sciences of the Czech Republic

A note on fuzzy predicate logic. Petr H jek 1. Academy of Sciences of the Czech Republic A note on fuzzy predicate logic Petr H jek 1 Institute of Computer Science, Academy of Sciences of the Czech Republic Pod vod renskou v 2, 182 07 Prague. Abstract. Recent development of mathematical fuzzy

More information

Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results

Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results Francesc Esteva, Lluís Godo, Carles Noguera Institut d Investigació en Intel ligència Artificial - CSIC Catalonia,

More information

First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties

First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties Francesc Esteva, Lluís Godo Institut d Investigació en Intel ligència Artificial - CSIC Catalonia,

More information

Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics

Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics Carles Noguera Dept. of Mathematics and Computer Science, University of Siena Pian dei Mantellini 44,

More information

Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation

Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation Tommaso Flaminio Dipartimento di Matematica Università di Siena Pian dei Mantellini 44 53100 Siena (Italy) flaminio@unisi.it

More information

Residuated fuzzy logics with an involutive negation

Residuated fuzzy logics with an involutive negation Arch. Math. Logic (2000) 39: 103 124 c Springer-Verlag 2000 Residuated fuzzy logics with an involutive negation Francesc Esteva 1, Lluís Godo 1, Petr Hájek 2, Mirko Navara 3 1 Artificial Intelligence Research

More information

Non-classical Logics: Theory, Applications and Tools

Non-classical Logics: Theory, Applications and Tools Non-classical Logics: Theory, Applications and Tools Agata Ciabattoni Vienna University of Technology (TUV) Joint work with (TUV): M. Baaz, P. Baldi, B. Lellmann, R. Ramanayake,... N. Galatos (US), G.

More information

Boolean Algebra and Propositional Logic

Boolean Algebra and Propositional Logic Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a

More information

Free Weak Nilpotent Minimum Algebras

Free Weak Nilpotent Minimum Algebras Algorithms and Complexity Group Institute of Computer Graphics and Algorithms TU Wien, Vienna, Austria April 01 Free Weak Nilpotent Minimum Algebras Stefano Aguzzoli, Simone Bova, and Diego Valota This

More information

On the filter theory of residuated lattices

On the filter theory of residuated lattices On the filter theory of residuated lattices Jiří Rachůnek and Dana Šalounová Palacký University in Olomouc VŠB Technical University of Ostrava Czech Republic Orange, August 5, 2013 J. Rachůnek, D. Šalounová

More information

On the set of intermediate logics between the truth and degree preserving Lukasiewicz logics

On the set of intermediate logics between the truth and degree preserving Lukasiewicz logics On the set of intermediate logics between the truth and degree preserving Lukasiewicz logics Marcelo Coniglio 1 Francesc Esteva 2 Lluís Godo 2 1 CLE and Department of Philosophy State University of Campinas

More information

1. Propositional Calculus

1. Propositional Calculus 1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:

More information

Boolean Algebra and Propositional Logic

Boolean Algebra and Propositional Logic Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection

More information

Aggregation and Non-Contradiction

Aggregation 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 information

1. Propositional Calculus

1. Propositional Calculus 1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:

More information

(Algebraic) Proof Theory for Substructural Logics and Applications

(Algebraic) Proof Theory for Substructural Logics and Applications (Algebraic) Proof Theory for Substructural Logics and Applications Agata Ciabattoni Vienna University of Technology agata@logic.at (Algebraic) Proof Theory for Substructural Logics and Applications p.1/59

More information

MTL-algebras via rotations of basic hoops

MTL-algebras via rotations of basic hoops MTL-algebras via rotations of basic hoops Sara Ugolini University of Denver, Department of Mathematics (Ongoing joint work with P. Aglianò) 4th SYSMICS Workshop - September 16th 2018 A commutative, integral

More information

On the Independence of the Formal System L *

On the Independence of the Formal System L * 6 International Journal of Fuzzy Systems, Vol. 4, No., June On the Independence of the Formal System L * Daowu Pei Astract The formal system L * of fuzzy propositional logic has een successfully applied

More information

Fleas and fuzzy logic a survey

Fleas and fuzzy logic a survey Fleas and fuzzy logic a survey Petr Hájek Institute of Computer Science AS CR Prague hajek@cs.cas.cz Dedicated to Professor Gert H. Müller on the occasion of his 80 th birthday Keywords: mathematical fuzzy

More information

Multiplicative Conjunction and an Algebraic. Meaning of Contraction and Weakening. A. Avron. School of Mathematical Sciences

Multiplicative Conjunction and an Algebraic. Meaning of Contraction and Weakening. A. Avron. School of Mathematical Sciences Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening A. Avron School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv 69978, Israel Abstract

More information

When does a semiring become a residuated lattice?

When 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 information

Reasoning about uncertainty of fuzzy events: an overview

Reasoning about uncertainty of fuzzy events: an overview Reasoning about uncertainty of fuzzy events: an overview Tommaso Flaminio, Lluís Godo and Enrico Marchioni IIIA, Artificial Intelligence Research Institute CSIC, Spanish Scientific Research Council Campus

More information

A Fuzzy Formal Logic for Interval-valued Residuated Lattices

A Fuzzy Formal Logic for Interval-valued Residuated Lattices A Fuzzy Formal Logic for Interval-valued Residuated Lattices B. Van Gasse Bart.VanGasse@UGent.be C. Cornelis Chris.Cornelis@UGent.be G. Deschrijver Glad.Deschrijver@UGent.be E.E. Kerre Etienne.Kerre@UGent.be

More information

Interval Valued Fuzzy Sets from Continuous Archimedean. Triangular Norms. Taner Bilgic and I. Burhan Turksen. University of Toronto.

Interval Valued Fuzzy Sets from Continuous Archimedean. Triangular Norms. Taner Bilgic and I. Burhan Turksen. University of Toronto. Interval Valued Fuzzy Sets from Continuous Archimedean Triangular Norms Taner Bilgic and I. Burhan Turksen Department of Industrial Engineering University of Toronto Toronto, Ontario, M5S 1A4 Canada bilgic@ie.utoronto.ca,

More information

Fuzzy Logic in Narrow Sense with Hedges

Fuzzy Logic in Narrow Sense with Hedges Fuzzy Logic in Narrow Sense with Hedges ABSTRACT Van-Hung Le Faculty of Information Technology Hanoi University of Mining and Geology, Vietnam levanhung@humg.edu.vn arxiv:1608.08033v1 [cs.ai] 29 Aug 2016

More information

On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice

On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice arxiv:0811.2107v2 [math.lo] 2 Oct 2009 FÉLIX BOU, FRANCESC ESTEVA and LLUÍS GODO, Institut d Investigació en Intel.ligència Artificial,

More information

Triple Rotation: Gymnastics for T-norms

Triple Rotation: Gymnastics for T-norms Triple Rotation: Gymnastics for T-norms K.C. Maes Department of Applied Mathematics, Biometrics and Process Control, Ghent University, Coupure links 653, B-9 Gent, Belgium Koen.Maes@Ugent.be B. De Baets

More information

Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +

Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + REPORTS ON MATHEMATICAL LOGIC 40 (2006), 3 13 Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + A b s t r a c t. In this paper it is proved that the interval

More information

Implicational F -Structures and Implicational Relevance. Logics. A. Avron. Sackler Faculty of Exact Sciences. School of Mathematical Sciences

Implicational F -Structures and Implicational Relevance. Logics. A. Avron. Sackler Faculty of Exact Sciences. School of Mathematical Sciences Implicational F -Structures and Implicational Relevance Logics A. Avron Sackler Faculty of Exact Sciences School of Mathematical Sciences Tel Aviv University Ramat Aviv 69978, Israel Abstract We describe

More information

Soft set theoretical approach to residuated lattices. 1. Introduction. Young Bae Jun and Xiaohong Zhang

Soft set theoretical approach to residuated lattices. 1. Introduction. Young Bae Jun and Xiaohong Zhang Quasigroups and Related Systems 24 2016, 231 246 Soft set theoretical approach to residuated lattices Young Bae Jun and Xiaohong Zhang Abstract. Molodtsov's soft set theory is applied to residuated lattices.

More information

On Very True Operators and v-filters

On Very True Operators and v-filters On Very True Operators and v-filters XUEJUN LIU Zhejiang Wanli University School of Computer and Information Technology Ningbo 315100 People s Republic of China ZHUDENG WANG Zhejiang Wanli University Institute

More information

Uninorm Based Logic As An Extension of Substructural Logics FL e

Uninorm Based Logic As An Extension of Substructural Logics FL e Uninorm Based Logic As An Extension of Substructural Logics FL e Osamu WATARI Hokkaido Automotive Engineering College Sapporo 062-0922, JAPAN watari@haec.ac.jp Mayuka F. KAWAGUCHI Division of Computer

More information

BL-Functions and Free BL-Algebra

BL-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 information

Omitting Types in Fuzzy Predicate Logics

Omitting Types in Fuzzy Predicate Logics University of Ostrava Institute for Research and Applications of Fuzzy Modeling Omitting Types in Fuzzy Predicate Logics Vilém Novák and Petra Murinová Research report No. 126 2008 Submitted/to appear:

More information

De Morgan Systems on the Unit Interval

De Morgan Systems on the Unit Interval De Morgan Systems on the Unit Interval Mai Gehrke y, Carol Walker, and Elbert Walker Department of Mathematical Sciences New Mexico State University Las Cruces, NM 88003 mgehrke, hardy, elbert@nmsu.edu

More information

The Morita-equivalence between MV-algebras and abelian l-groups with strong unit

The Morita-equivalence between MV-algebras and abelian l-groups with strong unit The Morita-equivalence between MV-algebras and abelian l-groups with strong unit Olivia Caramello and Anna Carla Russo December 4, 2013 Abstract We show that the theory of MV-algebras is Morita-equivalent

More information

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC

AN 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 information

New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space

New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space Lesson 6: Linear independence, matrix column space and null space New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space Two linear systems:

More information

An Introduction to Modal Logic III

An Introduction to Modal Logic III An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami

More information

The quest for the basic fuzzy logic

The quest for the basic fuzzy logic Petr Cintula 1 Rostislav Horčík 1 Carles Noguera 1,2 1 Institute of Computer Science, Academy of Sciences of the Czech Republic Pod vodárenskou věží 2, 182 07 Prague, Czech Republic 2 Institute of Information

More information

Many-Valued Semantics for Vague Counterfactuals

Many-Valued Semantics for Vague Counterfactuals Many-Valued Semantics for Vague Counterfactuals MARCO CERAMI AND PERE PARDO 1 1 Introduction This paper is an attempt to provide a formal semantics to counterfactual propositions that involve vague sentences

More information

Exploring a Syntactic Notion of Modal Many-Valued Logics

Exploring a Syntactic Notion of Modal Many-Valued Logics Mathware & Soft Computing 15 (2008) 175-188 Exploring a Syntactic Notion of Modal Many-Valued Logics F. Bou, F. Esteva and L. Godo IIIA - CSIC 08193 Bellaterra, Spain {fbou,esteva,godo}@iiia.csic.es Abstract

More information

Computing Spectra via Dualities in the MTL hierarchy

Computing Spectra via Dualities in the MTL hierarchy Computing Spectra via Dualities in the MTL hierarchy Diego Valota Department of Computer Science University of Milan valota@di.unimi.it 11th ANNUAL CECAT WORKSHOP IN POINTFREE MATHEMATICS Overview Spectra

More information

Paraconsistency properties in degree-preserving fuzzy logics

Paraconsistency properties in degree-preserving fuzzy logics Noname manuscript No. (will be inserted by the editor) Paraconsistency properties in degree-preserving fuzzy logics Rodolfo Ertola Francesc Esteva Tommaso Flaminio Lluís Godo Carles Noguera Abstract Paraconsistent

More information

A logic for reasoning about the probability of fuzzy events

A logic for reasoning about the probability of fuzzy events A logic for reasoning about the probability of fuzzy events Tommaso Flaminio Dip. di Matematica e Scienze Informatiche, University of Siena 53100 Siena, Italy flaminio@unisi.it Lluís Godo IIIA - CSIC 08193

More information

Embedding logics into product logic. Abstract. We construct a faithful interpretation of Lukasiewicz's logic in the product logic (both

Embedding logics into product logic. Abstract. We construct a faithful interpretation of Lukasiewicz's logic in the product logic (both 1 Embedding logics into product logic Matthias Baaz Petr Hajek Jan Krajcek y David Svejda Abstract We construct a faithful interpretation of Lukasiewicz's logic in the product logic (both propositional

More information

Logics preserving degrees of truth and the hierarchies of abstract algebraic logic

Logics preserving degrees of truth and the hierarchies of abstract algebraic logic Logics preserving degrees of truth and the hierarchies of abstract algebraic logic Josep Maria Font Department of Probability, Logic and Statistics Faculty of Mathematics University of Barcelona XV Simposio

More information

What is mathematical fuzzy logic

What is mathematical fuzzy logic Fuzzy Sets and Systems 157 (2006) 597 603 www.elsevier.com/locate/fss What is mathematical fuzzy logic Petr Hájek Institute of Computer Science, Academy of Sciences of the Czech Republic, 182 07 Prague,

More information

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

A logic for reasoning about the probability of fuzzy events

A logic for reasoning about the probability of fuzzy events A logic for reasoning about the probability of fuzzy events Tommaso Flaminio a Lluís Godo b a Dipartimento di Matematica e Scienze Informatiche, Università di Siena, 53100 Siena, Italy b IIIA - CSIC, 08193

More information

Fuzzy Answer Set semantics for Residuated Logic programs

Fuzzy 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

Interpolation and Beth Definability over the Minimal Logic

Interpolation and Beth Definability over the Minimal Logic Interpolation and Beth Definability over the Minimal Logic Larisa Maksimova 1 Sobolev Institute of Mathematics Siberian Branch of Russian Academy of Sciences Novosibirsk 630090, Russia Abstract Extensions

More information

International Journal of Approximate Reasoning

International Journal of Approximate Reasoning International Journal of Approximate Reasoning 51 (2010) 632 655 Contents lists available at ScienceDirect International Journal of Approximate Reasoning journal homepage: www.elsevier.com/locate/ijar

More information

Introduction to Fuzzy Sets and Fuzzy Logic

Introduction to Fuzzy Sets and Fuzzy Logic Introduction to Fuzzy Sets and Fuzzy Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada REASONPARK. Foligno, 17-19 September 2009 1/

More information

On some Metatheorems about FOL

On some Metatheorems about FOL On some Metatheorems about FOL February 25, 2014 Here I sketch a number of results and their proofs as a kind of abstract of the same items that are scattered in chapters 5 and 6 in the textbook. You notice

More information

1 Introduction A general problem that arises in dierent areas of computer science is the following combination problem: given two structures or theori

1 Introduction A general problem that arises in dierent areas of computer science is the following combination problem: given two structures or theori Combining Unication- and Disunication Algorithms Tractable and Intractable Instances Klaus U. Schulz CIS, University of Munich Oettingenstr. 67 80538 Munchen, Germany e-mail: schulz@cis.uni-muenchen.de

More information

On Fuzzy Negations and Automorphisms

On Fuzzy Negations and Automorphisms Anais do CNMAC v.2 ISSN 1984-820X On Fuzzy Negations and Automorphisms Benjamín Callejas Bedregal, Laboratório de Lógica, Linguagem, Informação, Teoria e Aplicações-LoLITA, Departamento de Informática

More information

Splitting a Default Theory. Hudson Turner. University of Texas at Austin.

Splitting a Default Theory. Hudson Turner. University of Texas at Austin. Splitting a Default Theory Hudson Turner Department of Computer Sciences University of Texas at Austin Austin, TX 7872-88, USA hudson@cs.utexas.edu Abstract This paper presents mathematical results that

More information

A duality-theoretic approach to MTL-algebras

A 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 information

Modal systems based on many-valued logics

Modal systems based on many-valued logics Modal systems based on many-valued logics F. Bou IIIA - CSIC Campus UAB s/n 08193, Bellaterra, Spain fbou@iiia.csic.es F. Esteva IIIA - CSIC Campus UAB s/n 08193, Bellaterra, Spain esteva@iiia.csic.es

More information

Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete

Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete Félix Bou University of Barcelona (UB) Barcelona, Spain

More information

Fuzzy Logics and Substructural Logics without Exchange

Fuzzy Logics and Substructural Logics without Exchange Fuzzy Logics and Substructural Logics without Exchange Mayuka F. KAWAGUCHI Division of Computer Science Hokkaido University Sapporo 060-0814, JAPAN mayuka@main.ist.hokudai.ac.jp Osamu WATARI Hokkaido Automotive

More information

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics

More information

MONOGRAFIES DE L INSTITUT D INVESTIGACIÓ EN INTEL LIGÈNCIA ARTIFICIAL Number 27

MONOGRAFIES DE L INSTITUT D INVESTIGACIÓ EN INTEL LIGÈNCIA ARTIFICIAL Number 27 MONOGRAFIES DE L INSTITUT D INVESTIGACIÓ EN INTEL LIGÈNCIA ARTIFICIAL Number 27 Institut d Investigació en Intel ligència Artificial Consell Superior d Investigacions Científiques Algebraic study of axiomatic

More information

On some axiomatic extensions of the monoidal t-norm based logic MTL: an analysis in the propositional and in the first-order case

On some axiomatic extensions of the monoidal t-norm based logic MTL: an analysis in the propositional and in the first-order case Facoltà di Scienze Matematiche Fisiche e Naturali Dipartimento di Matematica Federigo Enriques Dottorato in Matematica e Statistica per le Scienze Computazionali (MaSSC) Ciclo XXIII On some axiomatic extensions

More information

Basic Algebraic Logic

Basic Algebraic Logic ELTE 2013. September Today Past 1 Universal Algebra 1 Algebra 2 Transforming Algebras... Past 1 Homomorphism 2 Subalgebras 3 Direct products 3 Varieties 1 Algebraic Model Theory 1 Term Algebras 2 Meanings

More information

185.A09 Advanced Mathematical Logic

185.A09 Advanced Mathematical Logic 185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted

More information

Abstract In this paper, we introduce the logic of a control action S4F and the logic of a continuous control action S4C on the state space of a dynami

Abstract In this paper, we introduce the logic of a control action S4F and the logic of a continuous control action S4C on the state space of a dynami Modal Logics and Topological Semantics for Hybrid Systems Mathematical Sciences Institute Technical Report 97-05 S. N. Artemov, J. M. Davoren y and A. Nerode z Mathematical Sciences Institute Cornell University

More information

Fuzzy logic Fuzzyapproximate reasoning

Fuzzy 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 information

BG/BF 1 /B/BM-algebras are congruence permutable

BG/BF 1 /B/BM-algebras are congruence permutable Mathematica Aeterna, Vol. 5, 2015, no. 2, 351-35 BG/BF 1 /B/BM-algebras are congruence permutable Andrzej Walendziak Institute of Mathematics and Physics Siedlce University, 3 Maja 54, 08-110 Siedlce,

More information

Reinhold Heckmann. FB 14 { Informatik. D-6600 Saarbrucken. Bundesrepublik Deutschland. September 10, Abstract

Reinhold Heckmann. FB 14 { Informatik. D-6600 Saarbrucken. Bundesrepublik Deutschland. September 10, Abstract Power Domain Constructions Reinhold Heckmann FB 14 { Informatik Universitat des Saarlandes D-6600 Saarbrucken Bundesrepublik Deutschland email: heckmann@cs.uni-sb.de September 10, 1998 Abstract The variety

More information

On the Intersections of QL-Implications with (S, N)- and R-Implications

On the Intersections of QL-Implications with (S, N)- and R-Implications On the Intersections of QL-Implications with (S, N)- and R-Implications Balasubramaniam Jayaram Dept. of Mathematics and Computer Sciences, Sri Sathya Sai Institute of Higher Learning, Prasanthi Nilayam,

More information

Chapter I: Introduction to Mathematical Fuzzy Logic

Chapter I: Introduction to Mathematical Fuzzy Logic Chapter I: Introduction to Mathematical Fuzzy Logic LIBOR BĚHOUNEK, PETR CINTULA, AND PETR HÁJEK This chapter provides an introduction to the field of mathematical fuzzy logic, giving an overview of its

More information

Implicational classes ofde Morgan Boolean algebras

Implicational classes ofde Morgan Boolean algebras Discrete Mathematics 232 (2001) 59 66 www.elsevier.com/locate/disc Implicational classes ofde Morgan Boolean algebras Alexej P. Pynko Department of Digital Automata Theory, V.M. Glushkov Institute of Cybernetics,

More information

Probability Measures in Gödel Logic

Probability Measures in Gödel Logic Probability Measures in Gödel Logic Diego Valota Department of Computer Science University of Milan valota@di.unimi.it Joint work with Stefano Aguzzoli (UNIMI), Brunella Gerla and Matteo Bianchi (UNINSUBRIA)

More information

EXTRACTING FUZZY IF-THEN RULE BY USING THE INFORMATION MATRIX TECHNIQUE WITH QUASI-TRIANGULAR FUZZY NUMBERS

EXTRACTING FUZZY IF-THEN RULE BY USING THE INFORMATION MATRIX TECHNIQUE WITH QUASI-TRIANGULAR FUZZY NUMBERS STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume LIV, Number 3, September 2009 EXTRACTING FUZZY IF-THEN RULE BY USING THE INFORMATION MATRIX TECHNIQUE WITH QUASI-TRIANGULAR FUZZY NUMBERS ZOLTÁN MAKÓ Abstract.

More information

EQ-ALGEBRAS WITH PSEUDO PRE-VALUATIONS. Yongwei Yang 1. Xiaolong Xin

EQ-ALGEBRAS WITH PSEUDO PRE-VALUATIONS. Yongwei Yang 1. Xiaolong Xin italian journal of pure and applied mathematics n. 37 2017 (29 48) 29 EQ-ALGEBRAS WITH PSEUDO PRE-VALUATIONS Yongwei Yang 1 School of Mathematics and Statistics Anyang Normal University Anyang 455000 China

More information

Some consequences of compactness in Lukasiewicz Predicate Logic

Some 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 information

Fundamentals of Fuzzy Logics

Fundamentals of Fuzzy Logics Fundamentals of Fuzzy Logics George Metcalfe University of Technology, Vienna, Austria metcalfe@logic.at 1 Introduction Logics come in many guises. Classical logic, to take the most obvious example, may

More information

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Overview I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Propositional formulas Grammar: ::= p j (:) j ( ^ )

More information

7th European Symposium on Computational Intelligence and Mathematics ESCIM Cádiz, Spain. October 7th-10th, Proceedings.

7th European Symposium on Computational Intelligence and Mathematics ESCIM Cádiz, Spain. October 7th-10th, Proceedings. 7th European Symposium on Computational Intelligence and Mathematics ESCIM 2015 Cádiz, Spain October 7th-10th, 2015 Proceedings Editors: László Kóczy, Jesús Medina Associate Editors: María Eugenia Cornejo-Piñero,

More information

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic E. Turunen Tampere Univ. of Technology, P.O. Box 553, 33101 Tampere, Finland, M. Öztürk CRIL, Univ. d Artois, F 62307 Lens, France, A.

More information

THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL

THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL 1 MINXIA LUO, 2 NI SANG, 3 KAI ZHANG 1 Department of Mathematics, China Jiliang University Hangzhou, China E-mail: minxialuo@163.com ABSTRACT

More information

A Preference Semantics. for Ground Nonmonotonic Modal Logics. logics, a family of nonmonotonic modal logics obtained by means of a

A Preference Semantics. for Ground Nonmonotonic Modal Logics. logics, a family of nonmonotonic modal logics obtained by means of a A Preference Semantics for Ground Nonmonotonic Modal Logics Daniele Nardi and Riccardo Rosati Dipartimento di Informatica e Sistemistica, Universita di Roma \La Sapienza", Via Salaria 113, I-00198 Roma,

More information

Wojciech Penczek. Polish Academy of Sciences, Warsaw, Poland. and. Institute of Informatics, Siedlce, Poland.

Wojciech Penczek. Polish Academy of Sciences, Warsaw, Poland. and. Institute of Informatics, Siedlce, Poland. A local approach to modal logic for multi-agent systems? Wojciech Penczek 1 Institute of Computer Science Polish Academy of Sciences, Warsaw, Poland and 2 Akademia Podlaska Institute of Informatics, Siedlce,

More information

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008 Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency

More information

A Family of Finite De Morgan Algebras

A Family of Finite De Morgan Algebras A Family of Finite De Morgan Algebras Carol L Walker Department of Mathematical Sciences New Mexico State University Las Cruces, NM 88003, USA Email: hardy@nmsuedu Elbert A Walker Department of Mathematical

More information

Display calculi in non-classical logics

Display calculi in non-classical logics Display calculi in non-classical logics Revantha Ramanayake Vienna University of Technology (TU Wien) Prague seminar of substructural logics March 28 29, 2014 Revantha Ramanayake (TU Wien) Display calculi

More information

FONT * AND GONZALO RODRÍGUEZ PÉREZ*

FONT * AND GONZALO RODRÍGUEZ PÉREZ* Publicacions Matemátiques, Vol 36 (1992), 591-599. A NOTE ON SUGIHARA ALGEBRAS JOSEP M. FONT * AND GONZALO RODRÍGUEZ PÉREZ* Abstract In [41 Blok and Pigozzi prove syntactically that RM, the propositional

More information

Contents 1 Introduction A historical note : : : : : : : : : : : : : : : : : : : : : : : : : Modal logic : : : : : : : : : : : : : : : : :

Contents 1 Introduction A historical note : : : : : : : : : : : : : : : : : : : : : : : : : Modal logic : : : : : : : : : : : : : : : : : On Axiomatizations for Propositional Logics of Programs P.M.W. Knijnenburg RUU-CS-88-34 November 1988 Contents 1 Introduction 3 1.1 A historical note : : : : : : : : : : : : : : : : : : : : : : : : : 3

More information

Admissible Rules of (Fragments of) R-Mingle. Admissible Rules of (Fragments of) R-Mingle. Laura Janina Schnüriger

Admissible Rules of (Fragments of) R-Mingle. Admissible Rules of (Fragments of) R-Mingle. Laura Janina Schnüriger Admissible Rules of (Fragments of) R-Mingle Admissible Rules of (Fragments of) R-Mingle joint work with George Metcalfe Universität Bern Novi Sad 5 June 2015 Table of contents 1. What and why? 1.1 What

More information

A Foundation for Metareasoning. Part

A Foundation for Metareasoning. Part istituto per la ricerca scientifica e tecnologica 38050 Povo (Trento), Italy Tel.: + 39 461 314575 Fax: + 39 461 314591 e-mail: prdocitc.it url: http://www.itc.it A Foundation for Metareasoning. Part II:

More information

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Agata Ciabattoni Mauro Ferrari Abstract In this paper we define cut-free hypersequent calculi for some intermediate logics semantically

More information

Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer Science Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives

More information

Some properties of residuated lattices

Some properties of residuated lattices Some properties of residuated lattices Radim Bělohlávek, Ostrava Abstract We investigate some (universal algebraic) properties of residuated lattices algebras which play the role of structures of truth

More information

In a second part, we concentrate on interval models similar to the traditional ITL models presented in [, 5]. By making various assumptions about time

In a second part, we concentrate on interval models similar to the traditional ITL models presented in [, 5]. By making various assumptions about time Complete Proof Systems for First Order Interval Temporal Logic Bruno Dutertre Department of Computer Science Royal Holloway, University of London Egham, Surrey TW0 0EX, United Kingdom Abstract Dierent

More information

Continuous R-implications

Continuous 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 information

On Urquhart s C Logic

On Urquhart s C Logic On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced

More information