POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS
|
|
- Aubrey Armstrong
- 6 years ago
- Views:
Transcription
1 Bull. Koren Mth. So. 35 (998), No., pp POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive implitive filter n n ssoitive filter in lttie implition lger. We prove tht (i) every positive implitive filter is n implitive filter, n (ii) every ssoitive filter is filter. We provie equivlent onitions for oth positive implitive filter n n ssoitive filter.. Introution In orer to reserh the logil system whose propositionl vlue is given in lttie, Y. Xu [Xu2] propose the onept of lttie implition lgers, n isusse their some properties in [Xu] n [Xu2]. Y. Xu n K. Y. Qin [XQ] introue the notions of filter n n implitive filter in lttie implition lger, n investigte their properties. Y. B. Jun [Ju] gve some equivlent onitions tht filter is n implitive filter in lttie implition lger, n estlishe n extension property for implitive filter. In this pper, We introue the onepts of positive implitive filter n n ssoitive filter in lttie implition lger. We prove tht every positive implitive filter is n implitive filter, n hene filter, n tht every ssoitive filter is filter. We give n exmple to show tht filter my not e n ssoitive filter. We provie equivlent onitions for oth positive implitive filter n n ssoitive filter. 2. Preliminries DEFINITION 2. (Xu [Xu2]). By lttie implition lger we men Reeive Mrh, Mthemtis Sujet Clssifition: 3G, 6B. Key wors n phrses: Lttie implition lger, positive implitive filter, ssoitive filter. *Supporte y the LG Yonm Fountion, 995.
2 Y. B. Jun, Y. Xu n K. Y. Qin oune lttie (L,,,, ) with orer-reversing involution n inry opertion stisfying the following xioms for ll x, y, z L: (I) x (y z) = y (x z), (I2) x x =, (I3) x y = y x, (I4) x y = y x = x = y, (I5) (x y) y = (y x) x, (L) (x y) z = (x z) (y z), (L2) (x y) z = (x z) (y z). We n efine prtil orering on lttie implition lger L y x y if n only if x y =. EXAMPLE 2.2. Let L := {,,,,}. Define the prtilly orere reltion on L s < < < <, n efine x y := min{x, y}, x y := mx{x, y} for ll x, y L n n s follows: x x Then (L,,,, ) is lttie implition lger. OBSERVATION (Xu [Xu2]). In lttie implition lger L, the following hol for ll x, y, z L: () x =, x = x n x =, (2) x y implies y z x z n z x z y, (3) (x y) ((y z) (x z)) =, (4) x ((x y) y) =. In wht follows, L woul men lttie implition lger unless otherwise speifie. In [XQ], Y. Xu n K. Y. Qin efine the notions of filter n n implitive filter in lttie implition lger. 54
3 Positive implitive n ssoitive filters DEFINITION 2.3 (Xu n Qin [XQ]). Let (L,,,, ) e lttie implition lger. A sus F of L is lle filter of L if it stisfies for ll x, y L: (F) F, (F2) x F n x y F imply y F. A suset F of L is lle n implitive filter of L, if it stisfies (F) n (F3) x (y z) F n x y F imply x z F for ll x, y, z L. LEMMA 2.4 (Jun [Ju]). Let F e non-empty suset of L. Then F is filter of L if n only if it stisfies for ll x, y F n z L: (i) x y z implies z F. LEMMA 2.5 (Jun [Ju]). Every filter F of L hs the following property: x y n x F imply y F. 3. Positive Implitive Filters MAIN DEFINITION. A suset F of L is lle positive implitive filter of L if it stisfies (F) n (F4) x ((y z) y) F n x F imply y F for ll x, y, z L. We first give n exmple of positive implitive filter of lttie implition lger. EXAMPLE 3.. Let L := {,,,,,}esetwithfiguresprtil orering. Define unry opertion n inry opertion onls follows (Tles n 2, respetively): 55
4 Y. B. Jun, Y. Xu n K. Y. Qin x x.. Figure Tle Define -n -opertions on L s follows: Tle 2 x y := (x y) y, x y := ((x y ) y ), for ll x, y L. Then L is lttie implition lger. It is esy to hek tht F := {,,}is positive implitive filter of L. THEOREM 3.. Every positive implitive filter of L is filter. Proof. Let F e positive implitive filter of L n let x y F n x F for ll x, y L. Putting z = y in (F4), we hve x ((y y) y) = x y F n x F. It follows from (F4) tht y F, whene F is filter of L. REMARK 3.2. The onverse of Theorem 3. my not e true. In ft, onsier lttie implition lger L s in Exmple 2.2. We know tht {} is filter of L, ut it is not positive implitive filter, sine (( ) ) = {}n / {}. Also, in Exmple 3., we know tht the suset G := {,}is filter, ut not positive implitive filter of L, sine (( ) ) = G for / G. Now we give n equivlent onition tht every filter is positive implitive filter. 56
5 Positive implitive n ssoitive filters THEOREM 3.3. Let F efilterofl.thenfis positive implitive filter of L if n only if for ll x, y L, (F5) (x y) x F implies x F. Proof. Assume tht F is positive implitive filter of L n let (x y) x F for ll x, y L. Thenwehve ((x y) x) = (x y) x F. Sine F, it follows from (F4) tht x F, n (F5) hols. Conversely, suppose tht F stisfies (F5). Let x ((y z) y) F n x F for ll y, z L. Then(y z) y Fy (F2), whih implies y F y (F5). Hene F is positive implitive filter of L n the proof is omplete. THEOREM 3.4. Let F e non-empty suset of L. If F is positive implitive filter of L, then it is n implitive filter of L. Proof. Let x (y z) F n x y F for ll x, y, z L. Then x (y z)=y (x z) [y (I)] (x y) (x (x z)). [y (I) n (3)] Sine F is filter of L (see Theorem 3.), it follows from Lemm 2.4 tht x (x z) F. On the other hn, using (I) n (I5) we hve ((x z) z) (x z) = x (((x z) z) z) = x ((z (x z)) (x z)) = x ((x (z z)) (x z)) = x ((x ) (x z)) = x ( (x z)) = x (x z) F. By Theorem 3.3, we get x z F. This ompletes the proof. OPEN PROBLEM. Does the onverse of Theorem 3.4 hol? 57
6 Y. B. Jun, Y. Xu n K. Y. Qin 4. Assoitive Filters MAIN DEFINITION 2. Let x e fixe element of L. A suset F of L is lle n ssoitive filter of L with respet to x if it stisfies (F) n (A) x (y z) F n x y F imply z F for ll y, z L. An ssoitive filter of L with respet to ll x is lle n ssoitive filter of L. Clerly, n ssoitive filter with respet to is the whole lger L. An ssoitive filter with respet to is oinient with filter. EXAMPLE 4.. Let L := {,,,,,}esetwithfigure2sprtil orering. Define unry opertion n inry opertion only Tles 3 n 4, respetively, n efine -n -opertions on L s follows: x y := (x y) y n x y := ((x y ) y ), respetively, for ll x, y L. x x.. Figure 2 Tle 3 Tle 4 Then L is lttie implition lger. It is routine to verify tht F := {,,} is n ssoitive filter of L with respet to n, ut not with respet to n, sine n ( )= = F, = Fut / F, ( ) = = F, = F ut / F. 58
7 Positive implitive n ssoitive filters PROPOSITION 4.. Everyssoitivefilterwithrespetto x ontins x itself. Proof. If x =, then it is trivil. Assume x. Let F e n ssoitive filter of L with respet to x. Note tht x ( x) = x x = F n x = F. It follows from (A) tht x F. THEOREM 4.. Every ssoitive filter is filter. Proof. Let F e n ssoitive filter of L n let x y F n x F for ll x, y L. Then x=x Fn (x y) = x y F. It follows from (A) tht y F. Hene F is filter of L REMARK 4.2. The onverse of Theorem 4. my not e true. In ft, we know tht, in Exmple 2.2, {} is filter of L. But it is not n ssoitive filter of L, sine ( )= = {}n = {},ut / {}. Now we give equivlent onitions tht every filter is n ssoitive filter. THEOREM 4.3. Let F e filter of L. ThenFis n ssoitive filter if n only if it stisfies (A2) x (y z) F implies (x y) z F for ll x, y, z L. Proof. If filter F of L stisfies the onition (A2), then lerly F is ssoitive. Conversely, let F e n ssoitive filter of L n let x (y z) F for ll x, y, z L. Then x ((y z) ((x y) z)) = (y z) (x ((x y) z)) [y (I)] = (y z) ((x y) (x z)) [y (I)] = F, [y (I) n (3)] whih implies from (A) tht (x y) z F. This ompletes the proof. THEOREM 4.4. Let F e filter of L. ThenFis n ssoitive filter if n only if it stisfies (A3) x (x y) F implies y F for ll x, y L. 59
8 Y. B. Jun, Y. Xu n K. Y. Qin Proof. Let F efilterofl. It is suffiient to show tht (A2) n (A3) re equivlent. Putting x = y in (A2) n using (I2) n (), we otin (A3). Assume tht (A3) hols n let x (y z) F for ll x, y, z L. Using (I), (I2), (), (2) n (3), we hve (x (y z)) (x (x ((x y) z))) = ((x (y z)) (x (x ((x y) z)))) = ((y z) (x ((x y) z))) ((x (y z)) (x (x ((x y) z)))) = (x (y z)) (((y z) (x ((x y) z))) (x (x ((x y) z)))) (x (y z)) (x (y z)) =, whih implies tht (x (y z)) (x (x ((x y) z))) = F. Sine x (y z) F n sine F is filter, it follows tht x (x ((x y) z)) F. By using (A3), we onlue tht (x y) z F. This ompletes the proof. ACKNOWLEDGEMENTS. The uthors express their thnks to the referee for his/her vlule suggestions. Referenes [Ju] Y. B. Jun, Implitive filters of lttie implition lgers, Bull. Koren Mth. So. 34 (997), [JX] Y. B. Jun n Y. Xu, Fuzzy filters of lttie implition lgers, sumitte. [Xu] Y. Xu, Homomorphisms in lttie implition lgers, Pro. of 5th Mny-Vlue Logil Congress of Chin (992), [Xu2], Lttie implition lgers, J. of Southwest Jiotong Univ. (993), [XQ] Y. Xu n K. Y. Qin, On filters of lttie implition lgers, J. Fuzzy Mth. (993),
9 Positive implitive n ssoitive filters [YW] B. Yun n W. Wu, Fuzzy iels on istriutive lttie, Fuzzy Sets n Systems 35 (99), YOUNG BAE JUN DEPARTMENT OF MATHEMATICS,GYEONGSANG NATIONAL UNIVERSITY,CHINJU 66-7, KOREA E-mil: yjun@nonge.gsnu..kr YANG XU DEPARTMENT OFAPPLIED MATHEMATICS,SOUTHWEST JIAOTONG UNIVERSITY,CHENGDU,SICHUAN 63, P. R. CHINA E-mil: yxu@enter2.swjtu.eu.n KEYUN QIN DEPARTMENT OF MATHEMATICS,HENAN NORMAL UNIVERSITY,XINXIANG,HENAN 4532, P. R. CHINA 6
On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras
Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie
More informationON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee
Kngweon-Kyungki Mth. Jour. 10 (2002), No. 2, pp. 117 122 ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups Sng Keun Lee Astrt. In this pper, we give some properties of left(right) semi-regulr nd g-regulr
More informationCompression of Palindromes and Regularity.
Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationGeneralized Kronecker Product and Its Application
Vol. 1, No. 1 ISSN: 1916-9795 Generlize Kroneker Prout n Its Applition Xingxing Liu Shool of mthemtis n omputer Siene Ynn University Shnxi 716000, Chin E-mil: lxx6407@163.om Astrt In this pper, we promote
More informationDIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS
Krgujev Journl of Mthemtis Volume 38() (204), Pges 35 49. DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS MOHAMMAD W. ALOMARI Abstrt. In this pper, severl bouns for the ifferene between two Riemn-
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More informationSOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES
Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment
More informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
More informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More informationTRANSITIVE AND ABSORBENT FILTERS OF LATTICE IMPLICATION ALGEBRAS
J. Appl. Math. & Informatics Vol. 32(2014), No. 3-4, pp. 323-330 http://dx.doi.org/10.14317/jami.2014.323 TRANSITIVE AND ABSORBENT FILTERS OF LATTICE IMPLICATION ALGEBRAS M. SAMBASIVA RAO Abstract. The
More informationLecture 8: Abstract Algebra
Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationSOME COPLANAR POINTS IN TETRAHEDRON
Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON
More informationIf the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:
Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions
More informationKENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)
KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A
More informationON n-fold FILTERS IN BL-ALGEBRAS
Jourl of Alger Numer Theor: Adves d Applitios Volume 2 Numer 29 Pges 27-42 ON -FOLD FILTERS IN BL-ALGEBRAS M. SHIRVANI-GHADIKOLAI A. MOUSSAVI A. KORDI 2 d A. AHMADI 2 Deprtmet of Mthemtis Trit Modres Uiversit
More informationOn the Spectra of Bipartite Directed Subgraphs of K 4
On the Spetr of Biprtite Direte Sugrphs of K 4 R. C. Bunge, 1 S. I. El-Znti, 1, H. J. Fry, 1 K. S. Kruss, 2 D. P. Roerts, 3 C. A. Sullivn, 4 A. A. Unsiker, 5 N. E. Witt 6 1 Illinois Stte University, Norml,
More informationSEMI-EXCIRCLE OF QUADRILATERAL
JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More information#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS
#A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,
More informationBoolean Algebra cont. The digital abstraction
Boolen Alger ont The igitl strtion Theorem: Asorption Lw For every pir o elements B. + =. ( + ) = Proo: () Ientity Distriutivity Commuttivity Theorem: For ny B + = Ientity () ulity. Theorem: Assoitive
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationOn a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of
More informationCHENG Chun Chor Litwin The Hong Kong Institute of Education
PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationHermite-Hadamard inequality for geometrically quasiconvex functions on co-ordinates
Int. J. Nonliner Anl. Appl. 8 27 No. 47-6 ISSN: 28-6822 eletroni http://dx.doi.org/.2275/ijn.26.483 Hermite-Hdmrd ineulity for geometrilly usionvex funtions on o-ordintes Ali Brni Ftemeh Mlmir Deprtment
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationarxiv: v2 [math.co] 31 Oct 2016
On exlue minors of onnetivity 2 for the lss of frme mtrois rxiv:1502.06896v2 [mth.co] 31 Ot 2016 Mtt DeVos Dryl Funk Irene Pivotto Astrt We investigte the set of exlue minors of onnetivity 2 for the lss
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationAbstraction of Nondeterministic Automata Rong Su
Astrtion of Nondeterministi Automt Rong Su My 6, 2010 TU/e Mehnil Engineering, Systems Engineering Group 1 Outline Motivtion Automton Astrtion Relevnt Properties Conlusions My 6, 2010 TU/e Mehnil Engineering,
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More information370 Y. B. Jun generate an LI-ideal by both an LI-ideal and an element. We dene a prime LI-ideal, and give an equivalent condition for a proper LI-idea
J. Korean Math. Soc. 36 (1999), No. 2, pp. 369{380 ON LI-IDEALS AND PRIME LI-IDEALS OF LATTICE IMPLICATION ALGEBRAS Young Bae Jun Abstract. As a continuation of the paper [3], in this paper we investigate
More informationAutomata and Regular Languages
Chpter 9 Automt n Regulr Lnguges 9. Introution This hpter looks t mthemtil moels of omputtion n lnguges tht esrie them. The moel-lnguge reltionship hs multiple levels. We shll explore the simplest level,
More informationEXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED
EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED Astrt. The GCD Str of Dvi Theorem n the numerous ppers relte to it hve lrgel een evote to shoing the equlit
More informationPre-Lie algebras, rooted trees and related algebraic structures
Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers
More informationHow many proofs of the Nebitt s Inequality?
How mny roofs of the Neitt s Inequlity? Co Minh Qung. Introdution On Mrh, 90, Nesitt roosed the following rolem () The ove inequlity is fmous rolem. There re mny eole interested in nd solved (). In this
More informationReview: set theoretic definition of the numbers. Natural numbers:
Review: reltions A inry reltion on set A is suset R Ñ A ˆ A, where elements p, q re written s. Exmple: A Z nd R t pmod nqu. A inry reltion on set A is... (R) reflexive if for ll P A; (S) symmetric if implies
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationLesson 55 - Inverse of Matrices & Determinants
// () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n
More informationEigenvectors and Eigenvalues
MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.
More information2. Properties of Functions
2. PROPERTIES OF FUNCTIONS 111 2. Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition 2.1.1. Given f : A B 1. f is one-to-one (short han is 1 1) or injetive if preimages are unique.
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationIntuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras
Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
More informationOn Symmetric Bi-Multipliers of Lattice Implication Algebras
International Mathematical Forum, Vol. 13, 2018, no. 7, 343-350 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2018.8423 On Symmetric Bi-Multipliers of Lattice Implication Algebras Kyung Ho
More informationLearning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus
Forml Query Lnguges: Reltionl Alger nd Reltionl Clculus Chpter 4 Lerning Gols Given dtse ( set of tles ) you will e le to express dtse query in Reltionl Alger (RA), involving the sic opertors (selection,
More informationFUNCTIONS OF α-slow INCREASE
Bulletin of Mthemticl Anlysis nd Applictions ISSN: 1821-1291, URL: http://www.bmth.org Volume 4 Issue 1 (2012), Pges 226-230. FUNCTIONS OF α-slow INCREASE (COMMUNICATED BY HÜSEYIN BOR) YILUN SHANG Abstrct.
More informationPropositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.
Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationBoolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More information+ = () i =, find the values of x & y. 4. Write the function in the simplifies from. ()tan i. x x. 5. Find the derivative of. 6.
Summer vtions Holid Home Work 7-8 Clss-XII Mths. Give the emple of reltion, whih is trnsitive ut neither refleive nor smmetri.. Find the vlues of unknown quntities if. + + () i =, find the vlues of & 7
More informationF / x everywhere in some domain containing R. Then, + ). (10.4.1)
0.4 Green's theorem in the plne Double integrls over plne region my be trnsforme into line integrls over the bounry of the region n onversely. This is of prtil interest beuse it my simplify the evlution
More informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationSeparable discrete functions: recognition and sufficient conditions
Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...
More information22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:
22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)
More informationA Short Introduction to Self-similar Groups
A Short Introution to Self-similr Groups Murry Eler* Asi Pifi Mthemtis Newsletter Astrt. Self-similr groups re fsinting re of urrent reserh. Here we give short, n hopefully essile, introution to them.
More informationMathematical Proofs Table of Contents
Mthemtil Proofs Tle of Contents Proof Stnr Pge(s) Are of Trpezoi 7MG. Geometry 8.0 Are of Cirle 6MG., 9 6MG. 7MG. Geometry 8.0 Volume of Right Cirulr Cyliner 6MG. 4 7MG. Geometry 8.0 Volume of Sphere Geometry
More informationON AN INEQUALITY FOR THE MEDIANS OF A TRIANGLE
Journl of Siene nd Arts Yer, No. (9), pp. 7-6, OIGINAL PAPE ON AN INEQUALITY FO THE MEDIANS OF A TIANGLE JIAN LIU Mnusript reeived:.5.; Aepted pper:.5.; Pulished online: 5.6.. Astrt. In this pper, we give
More informationCS 360 Exam 2 Fall 2014 Name
CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output
More informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More informationSolutions to Homework 6. (b) (This was not part of Exercise 1, but should have been) Let A and B be groups with A B. Then B A.
MTH 4- Astrct Alger II S7 Solutions to Homework 6 Exercise () Let A, B n C e groups with A B n B C Show tht A C () (This ws not prt of Exercise, ut shoul hve een) Let A n B e groups with A B Then B A ()
More informationProportions: A ratio is the quotient of two numbers. For example, 2 3
Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationRectangular group congruences on an epigroup
cholrs Journl of Engineering nd Technology (JET) ch J Eng Tech, 015; 3(9):73-736 cholrs Acdemic nd cientific Pulisher (An Interntionl Pulisher for Acdemic nd cientific Resources) wwwsspulishercom IN 31-435X
More informationSolids of Revolution
Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk
More informationON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS
ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS A. BAZSÓ Astrct. Depending on the prity of the positive integer n the lternting power sum T k n = k + k + + k...+ 1 n 1 n 1 + k. cn e extended to polynomil
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationPrefix-Free Subsets of Regular Languages and Descriptional Complexity
Prefix-Free Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek Jurj Šeej DCFS 2015 Prefix-Free Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek, Jurj Šeej 1/22 Outline Mximl
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationON CLOSED CONVEX HULLS AND THEIR EXTREME POINTS. S. K. Lee and S. M. Khairnar
Kngweon-Kyungki Mth. Jour. 12 (2004), No. 2, pp. 107 115 ON CLOSED CONVE HULLS AND THEIR ETREME POINTS S. K. Lee nd S. M. Khirnr Abstrct. In this pper, the new subclss denoted by S p (α, β, ξ, γ) of p-vlent
More informationad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)
10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.
More informationChapter Five - Eigenvalues, Eigenfunctions, and All That
Chpter Five - Eigenvlues, Eigenfunctions, n All Tht The prtil ifferentil eqution methos escrie in the previous chpter is specil cse of more generl setting in which we hve n eqution of the form L 1 xux,tl
More information#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z
#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z Kurt Girstmir Institut für Mthemtik, Universität Innsruck, Innsruck, Austri kurt.girstmir@uik.c.t Received: 10/4/16, Accepted: 7/3/17, Pulished:
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationTOPIC: LINEAR ALGEBRA MATRICES
Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED
More informationChapter 3. Vector Spaces. 3.1 Images and Image Arithmetic
Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner
More informationLecture 1 - Introduction and Basic Facts about PDEs
* 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV
More informationImplication Graphs and Logic Testing
Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,
More informationBoolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd
More informationarxiv: v1 [math.ct] 8 Sep 2009
On the briding of n Ann-tegory rxiv:0909.1486v1 [mth.ct] 8 Sep 2009 September 8, 2009 NGUYEN TIEN QUANG nd DANG DINH HANH Dept. of Mthemtis, Hnoi Ntionl University of Edution, Viet Nm Emil: nguyenqung272002@gmil.om
More informations the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p
Skeptil Rtionl Extensions Artur Mikitiuk nd Miros lw Truszzynski University of Kentuky, Deprtment of Computer Siene, Lexington, KY 40506{0046, frtur mirekg@s.engr.uky.edu Astrt. In this pper we propose
More informationarxiv: v1 [math.ca] 21 Aug 2018
rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More informationare coplanar. ˆ ˆ ˆ and iˆ
SML QUSTION Clss XII Mthemtis Time llowed: hrs Mimum Mrks: Generl Instrutions: i ll questions re ompulsor ii The question pper onsists of 6 questions divided into three Setions, B nd C iii Question No
More informationNFA and regex. the Boolean algebra of languages. non-deterministic machines. regular expressions
NFA nd regex l the Boolen lger of lnguges non-deterministi mhines regulr expressions Informtis The intersetion of two regulr lnguges is regulr Run oth mhines in prllel? Build one mhine tht simultes two
More informationSIMPLE NONLINEAR GRAPHS
S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle
More informationA New Grey-rough Set Model Based on Interval-Valued Grey Sets
Proceedings of the 009 IEEE Interntionl Conference on Systems Mn nd Cybernetics Sn ntonio TX US - October 009 New Grey-rough Set Model sed on Intervl-Vlued Grey Sets Wu Shunxing Deprtment of utomtion Ximen
More informationMAT 403 NOTES 4. f + f =
MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More information