<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Our Set Theory by Anna Chiara Nullo</title>
      <link>https://padlet.com/annachiaranullo/hkv8et1umis4</link>
      <description>&quot;Set theory&quot; by Anna,Giulia,Miriana and Francesca.
Made with love,guys!💘</description>
      <language>en-us</language>
      <pubDate>2018-11-30 09:36:44 UTC</pubDate>
      <lastBuildDate>2024-06-01 11:38:03 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet-assets.s3.amazonaws.com/icons/Rocket.png</url>
      </image>
      <item>
         <title></title>
         <author>annachiaranullo</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314465565</link>
         <description><![CDATA[<div>CAPITAL LETTER=SETS<br>SMALL LETTER=ELEMENTS<br>X=general element<br>A={a,e,i,o,u}=TABULAR FORM<br>A={x|x is a vocal of the alphabet}<br>|=such as<br><br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/201889822/b91a2df323dde27df09618cd85e70ffc/20181213_215519.png" />
         <pubDate>2018-12-13 20:43:24 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314465565</guid>
      </item>
      <item>
         <title></title>
         <author>annachiaranullo</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314471641</link>
         <description><![CDATA[<div>BUILDER FORM<br>VENN'S DIAGRAM is a simple circle.In it,we can represent our set's elements.<br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/201889822/7914287bd68f7dd1d66beb1b17b7e1bb/Venn1.png" />
         <pubDate>2018-12-13 21:04:04 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314471641</guid>
      </item>
      <item>
         <title>                           UNIVERSAL SET</title>
         <author>annachiaranullo</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314474728</link>
         <description><![CDATA[<div>The universal set is bigger than the others and contains them.<br>u=universal set.<br>{8,4,7} belongs to u.<br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/201889822/b95ff213e8014542bbc70f713589a9f9/universal_example2.png" />
         <pubDate>2018-12-13 21:15:25 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314474728</guid>
      </item>
      <item>
         <title>                               THE SUBSETS</title>
         <author>annachiaranullo</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314477783</link>
         <description><![CDATA[<div>RELATION BETWEEN TWO SUBSETS<br>Some authors use the symbols ⊂ and ⊃ to indicate <em>subset</em> and <em>superset</em> respectively; that is, with the same meaning and instead of the symbols, ⊆ and ⊇.So for example, for these authors, it is true of every set <em>A</em> that <em>A</em> ⊂ <em>A</em>.<br>EXAMPLES:<br><br></div><ul><li>The set A = {1, 2} is a proper subset of B = {1, 2, 3}, thus both expressions A ⊆ B and A ⊊ B are true.</li><li>The empty set { }, denoted by ∅, is also a subset of any given set <em>X</em>. It is also always a proper subset of any set except itself.</li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2018-12-13 21:27:41 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/314477783</guid>
      </item>
      <item>
         <title>                           OPERATION ON SETS</title>
         <author>annachiaranullo</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316297327</link>
         <description><![CDATA[<div>UNION<br>In <a href="https://en.m.wikipedia.org/wiki/Set_theory">set theory</a>, the <strong>union</strong> (denoted by ∪) of a collection of sets is the set of all <a href="https://en.m.wikipedia.org/wiki/Element_(set_theory)">elements</a> in the collection.<br>Elements can't be duplicated.<br>Ex:<br>A={1,3,6,8}<br>B={1,6,10,12}<br>A∪B={1,3,6,8,10,12}</div>]]></description>
         <enclosure url="" />
         <pubDate>2018-12-20 21:05:18 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316297327</guid>
      </item>
      <item>
         <title>                          STRICTLY INCLUDED</title>
         <author>mirianamiceri04</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316298439</link>
         <description><![CDATA[<div>The set <em>B</em> is strictly included in set <em>A</em> when every element of <em>B</em> is also element of <em>A</em>, but there are also elements of <em>A</em> that aren't elements of <em>B.</em></div>]]></description>
         <enclosure url="" />
         <pubDate>2018-12-20 21:12:28 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316298439</guid>
      </item>
      <item>
         <title>                      INTERSECTION </title>
         <author>pagnottafrancescapia</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316300873</link>
         <description><![CDATA[<div>the <strong>intersection </strong>of two <a href="https://en.m.wikipedia.org/wiki/Set_(mathematics)">sets</a>: “<em>A” </em>and “<em>B”</em> is the set that contains all elements of <em>A</em> that also belong to <em>B. we could write:<br></em>A ∩ B = { x| x( a ∈ A) ∧ ( b ∈ B)}<br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/338447237/198105ec14cb442a0d82cfa6a7e7f6fd/media.png" />
         <pubDate>2018-12-20 21:26:14 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316300873</guid>
      </item>
      <item>
         <title>SET SUBTRACTION</title>
         <author>montigiulia1006</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316499805</link>
         <description><![CDATA[<div>Set subtraction is a method which modifies a set by just removing the elements that belong to another set. This operation is represented by the symbols of minus or backslash (by - or \). <br>Ex: P\Q = P - Q = {x : x in P and x not in Q} <br>Q\P = Q - P = {x : x in Q and x not in P}<br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/338444337/02fa2f9228cb7cc2e7db7c4f7240d9c4/media.jpeg" />
         <pubDate>2018-12-22 07:33:41 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/316499805</guid>
      </item>
      <item>
         <title>Partition of a Set </title>
         <author>pagnottafrancescapia</author>
         <link>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/317176368</link>
         <description><![CDATA[<div>A partition of a set A is by definition any collection of subsets of A such that they are not empty, that they have an empty intersection two by two and such that their union coincides with the whole set A.<br><br> We will say that two or more subsets of A form a partition of A if they satisfy three conditions:<br> 1) nobody must be empty;<br> 2) in any case two subsets are taken and their intersection must be empty;<br> 3) their union must give us all the whole A.<br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/338447237/2c51748abe7ad183c7907dde68f7e973/media.jpeg" />
         <pubDate>2019-01-03 10:18:47 UTC</pubDate>
         <guid>https://padlet.com/annachiaranullo/hkv8et1umis4/wish/317176368</guid>
      </item>
   </channel>
</rss>
