<?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-03865495v1</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-22T06:41:33+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Positive First-Order Logic on Words and Graphs</title>
            <author role="aut">
              <persName>
                <forename type="first">Denis</forename>
                <surname>Kuperberg</surname>
              </persName>
              <email type="md5">20b2bb7dee56a780203333bc101e626d</email>
              <email type="domain">ens-lyon.fr</email>
              <idno type="idhal" notation="string">denis-kuperberg</idno>
              <idno type="idhal" notation="numeric">173498</idno>
              <idno type="halauthorid" notation="string">12306-173498</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5406-717X</idno>
              <idno type="IDREF">https://www.idref.fr/166992623</idno>
              <affiliation ref="#struct-441569"/>
              <affiliation ref="#struct-35418"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Denis</forename>
                <surname>Kuperberg</surname>
              </persName>
              <email type="md5">20b2bb7dee56a780203333bc101e626d</email>
              <email type="domain">ens-lyon.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-11-22 12:34:39</date>
              <date type="whenModified">2025-10-13 09:44:14</date>
              <date type="whenReleased">2022-11-24 08:54:02</date>
              <date type="whenProduced">2023-07-25</date>
              <date type="whenEndEmbargoed">2022-11-22</date>
              <ref type="file" target="https://hal.science/hal-03865495v1/document">
                <date notBefore="2022-11-22"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03865495v1/file/main.pdf" id="file-3865495-3379936">
                <date notBefore="2022-11-22"/>
              </ref>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2023-11-17 14:13:19</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="329647">
                <persName>
                  <forename>Denis</forename>
                  <surname>Kuperberg</surname>
                </persName>
                <email type="md5">20b2bb7dee56a780203333bc101e626d</email>
                <email type="domain">ens-lyon.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03865495</idno>
            <idno type="halUri">https://hal.science/hal-03865495</idno>
            <idno type="halBibtex">kuperberg:hal-03865495</idno>
            <idno type="halRefHtml">&lt;i&gt;Logical Methods in Computer Science&lt;/i&gt;, 19 (3), pp.7:1 - 7:35, 2023</idno>
            <idno type="halRef">Logical Methods in Computer Science, 19 (3), pp.7:1 - 7:35, 2023</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3865495-3379936"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt/>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Positive First-Order Logic on Words and Graphs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Denis</forename>
                    <surname>Kuperberg</surname>
                  </persName>
                  <email type="md5">20b2bb7dee56a780203333bc101e626d</email>
                  <email type="domain">ens-lyon.fr</email>
                  <idno type="idhal" notation="string">denis-kuperberg</idno>
                  <idno type="idhal" notation="numeric">173498</idno>
                  <idno type="halauthorid" notation="string">12306-173498</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5406-717X</idno>
                  <idno type="IDREF">https://www.idref.fr/166992623</idno>
                  <affiliation ref="#struct-441569"/>
                  <affiliation ref="#struct-35418"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">1692</idno>
                <idno type="eissn">1860-5974</idno>
                <title level="j">Logical Methods in Computer Science</title>
                <imprint>
                  <publisher>Logical Methods in Computer Science Association</publisher>
                  <biblScope unit="volume">19</biblScope>
                  <biblScope unit="issue">3</biblScope>
                  <biblScope unit="pp">7:1 - 7:35</biblScope>
                  <date type="datePub">2023-07-25</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="info.info-fl">Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]</classCode>
              <classCode scheme="halDomain" n="math.math-lo">Mathematics [math]/Logic [math.LO]</classCode>
              <classCode scheme="halTypology" n="ISSUE">Special issue</classCode>
              <classCode scheme="halOldTypology" n="DOUV">Directions of work or proceedings</classCode>
              <classCode scheme="halTreeTypology" n="ISSUE">Special issue</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO +. This provides a simple proof that Lyndon's preservation theorem fails on finite structures. We lift this example language to finite graphs, thereby providing a new result of independent interest for FO-definable graph classes: negation might be needed even when the class is closed under addition of edges. We finally show that given a regular language of finite words, it is undecidable whether it is definable in FO + .</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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>
        <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="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>
      </listOrg>
    </back>
  </text>
</TEI>