<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00692153</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-25T01:54:39+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Streams</title>
            <author role="aut">
              <persName>
                <forename type="first">Colin</forename>
                <surname>Riba</surname>
              </persName>
              <email type="md5">60a28bb650652dc54db93fdd1dcc386d</email>
              <email type="domain">ens-lyon.fr</email>
              <idno type="idhal" notation="numeric">938059</idno>
              <idno type="halauthorid" notation="string">117918-938059</idno>
              <affiliation ref="#struct-35418"/>
              <affiliation ref="#struct-458310"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Colin</forename>
                <surname>Riba</surname>
              </persName>
              <email type="md5">60a28bb650652dc54db93fdd1dcc386d</email>
              <email type="domain">ens-lyon.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2012-04-28 16:44:03</date>
              <date type="whenWritten">2012-04-28</date>
              <date type="whenModified">2025-10-13 09:44:14</date>
              <date type="whenReleased">2012-04-30 09:03:54</date>
              <date type="whenProduced">2012-09-26</date>
              <date type="whenEndEmbargoed">2012-04-28</date>
              <ref type="file" target="https://hal.science/hal-00692153v1/document">
                <date notBefore="2012-04-28"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00692153v1/file/main.pdf" id="file-692153-1131973">
                <date notBefore="2012-04-28"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-33475-7_22.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="108206">
                <persName>
                  <forename>Colin</forename>
                  <surname>Riba</surname>
                </persName>
                <email type="md5">60a28bb650652dc54db93fdd1dcc386d</email>
                <email type="domain">ens-lyon.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00692153</idno>
            <idno type="halUri">https://hal.science/hal-00692153</idno>
            <idno type="halBibtex">riba:hal-00692153</idno>
            <idno type="halRefHtml">&lt;i&gt;7th International Conference on Theoretical Computer Science (TCS)&lt;/i&gt;, Sep 2012, Amsterdam, Netherlands. pp.310-324, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-33475-7_22"&gt;&amp;#x27E8;10.1007/978-3-642-33475-7_22&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.310-324, &amp;#x27E8;10.1007/978-3-642-33475-7_22&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-692153-1131973"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
            <idno type="stamp" n="LIP" corresp="UNIV-LYON1">Laboratoire de l'Informatique du Parallélisme</idno>
            <idno type="stamp" n="LIP_PLUME" corresp="LIP">PLUME</idno>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC1" corresp="IFIP-TC">IFIP TC1: Foundations of Computer Science</idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-TC2" corresp="IFIP-TC">IFIP TC 2: Software:Theory and Practice</idno>
            <idno type="stamp" n="IFIP-TCS">IFIP-TCS</idno>
            <idno type="stamp" n="IFIP-WG2-2">WG2-2: Formal Description of Programming Concepts</idno>
            <idno type="stamp" n="IFIP-LNCS-7604" corresp="IFIP-LNCS">Theoretical Computer Science</idno>
            <idno type="stamp" n="UDL">UDL</idno>
            <idno type="stamp" n="UNIV-LYON">Université de Lyon</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Streams</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Colin</forename>
                    <surname>Riba</surname>
                  </persName>
                  <email type="md5">60a28bb650652dc54db93fdd1dcc386d</email>
                  <email type="domain">ens-lyon.fr</email>
                  <idno type="idhal" notation="numeric">938059</idno>
                  <idno type="halauthorid" notation="string">117918-938059</idno>
                  <affiliation ref="#struct-35418"/>
                  <affiliation ref="#struct-458310"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>7th International Conference on Theoretical Computer Science (TCS)</title>
                  <date type="start">2012-09-26</date>
                  <date type="end">2012-09-28</date>
                  <settlement>Amsterdam</settlement>
                  <country key="NL">Netherlands</country>
                </meeting>
                <editor>Jos C. M. Baeten</editor>
                <editor>Tom Ball</editor>
                <editor>Frank S. Boer</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Theoretical Computer Science</biblScope>
                  <biblScope unit="volume">LNCS-7604</biblScope>
                  <biblScope unit="pp">310-324</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-33475-7_22</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We discuss the completeness of an axiomatization of Monadic Second- Order Logic (MSO) on infinite words (or streams). By using model-theoretic tools, we give an alternative proof of D. Siefkes' result that a fragment with full comprehension and induction of second-order Peano's arithmetic is com- plete w.r.t. the validity of MSO-formulas on streams. We rely on Feferman- Vaught Theorems and the Ehrenfeucht-Fra ̈ıss ́e method for Henkin models of second-order arithmetic. Our main technical contribution is an infinitary Feferman-Vaught Fusion of such models. We show it using Ramseyan fac- torizations similar to those for standard infinite words. We also discuss a Ramsey's theorem for MSO-definable colorings, and show that in linearly ordered Henkin models, Ramsey's theorem for additive MSO-definable col- orings implies Ramsey's theorem for all MSO-definable colorings.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">TC 2</org>
              <org type="consortium">WG 2.2</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-35418" status="VALID">
          <idno type="IdRef">191041289</idno>
          <idno type="ISNI">0000000104538607</idno>
          <idno type="RNSR">200317503S</idno>
          <idno type="ROR">04msnz457</idno>
          <orgName>Laboratoire de l'Informatique du Parallélisme</orgName>
          <orgName type="acronym">LIP</orgName>
          <date type="start">1990-01-01</date>
          <desc>
            <address>
              <addrLine>46 Allée d'Italie 69364 LYON CEDEX 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-lyon.fr/LIP/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6818" type="direct"/>
            <relation active="#struct-301088" type="direct"/>
            <relation active="#struct-194495" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-458310" status="VALID">
          <orgName>Preuves et Langages</orgName>
          <orgName type="acronym">PLUME</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-lyon.fr/LIP/PLUME/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-35418" type="direct"/>
            <relation active="#struct-6818" type="indirect"/>
            <relation active="#struct-301088" type="indirect"/>
            <relation active="#struct-194495" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-6818" status="VALID">
          <idno type="IdRef">149154992</idno>
          <idno type="ISNI">0000000123319856</idno>
          <idno type="ROR">https://ror.org/04zmssz18</idno>
          <idno type="Wikidata">Q10159</idno>
          <orgName>École normale supérieure de Lyon</orgName>
          <orgName type="acronym">ENS de Lyon</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ens-lyon.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301088" status="VALID">
          <idno type="ROR">https://ror.org/01rk35k63</idno>
          <orgName>Université de Lyon</orgName>
          <desc>
            <address>
              <addrLine>92 rue Pasteur - CS 30122, 69361 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-lyon.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-194495" status="VALID">
          <idno type="IdRef">026402823</idno>
          <idno type="ISNI">0000000121686185</idno>
          <idno type="ROR">https://ror.org/029brtt94</idno>
          <orgName>Université Claude Bernard Lyon 1</orgName>
          <orgName type="acronym">UCBL</orgName>
          <desc>
            <address>
              <addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lyon1.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>