<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://hdl.handle.net/11320/3332">
    <title>DSpace Zesp&amp;#243;&amp;#322;:</title>
    <link>http://hdl.handle.net/11320/3332</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://hdl.handle.net/11320/20706" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/20702" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/20695" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/20690" />
      </rdf:Seq>
    </items>
    <dc:date>2026-08-14T11:11:46Z</dc:date>
  </channel>
  <item rdf:about="http://hdl.handle.net/11320/20706">
    <title>Uniform Boundedness Principle</title>
    <link>http://hdl.handle.net/11320/20706</link>
    <description>Tytu&amp;#322;: Uniform Boundedness Principle
Autorzy: Sakurai, Hideki; Kunimune, Hisayoshi; Shidama, Yasunari
Abstrakt: Inthisarticle at first, we proved the lemma of the inferior limit and the superior limit. Next, we proved the Baire category theorem (Banach space&#xD;
version) [20], [9], [3], quoted it and proved the uniform boundedness principle. Moreover, the proof of the Banach-Steinhaus theorem is added.</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/20702">
    <title>Gauss Lemma and Law of Quadratic Reciprocity</title>
    <link>http://hdl.handle.net/11320/20702</link>
    <description>Tytu&amp;#322;: Gauss Lemma and Law of Quadratic Reciprocity
Autorzy: Yan, Li; Liang, Xiquan; Zhao, Junjie
Abstrakt: In this paper, we defined the quadratic residue and proved its fundamental properties on the base of some useful theorems. Then we defined&#xD;
the Legendre symbol and proved its useful theorems [14], [12]. Finally, Gauss Lemma and Law of Quadratic Reciprocity are proven.</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/20695">
    <title>Regular Expression Quantifiers– at least m Occurrences</title>
    <link>http://hdl.handle.net/11320/20695</link>
    <description>Tytu&amp;#322;: Regular Expression Quantifiers– at least m Occurrences
Autorzy: Trybulec, Michał
Abstrakt: This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In&#xD;
the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7].</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/20690">
    <title>The Vector Space of Subsets of a Set Based on Symmetric Difference</title>
    <link>http://hdl.handle.net/11320/20690</link>
    <description>Tytu&amp;#322;: The Vector Space of Subsets of a Set Based on Symmetric Difference
Autorzy: Alama, Jesse
Abstrakt: For each set X, the power set of X forms a vector space over the field Z2 (the two-element field {0,1} with addition and multiplication done&#xD;
modulo 2): vector addition is disjoint union, and scalar multiplication is definedby the two equations (1·x := x, 0·x := ∅ for subsets x of X). See [10], Exercise2.K, for more information.</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

