Undecidability of a weak version of MSO+U

Undecidability of a weak version of MSO+U

We prove the undecidability of MSO on \(\omega\)-words extended with the second-order predicate \(U_1(X)\) which says that the distance between consecutive positions in a set \(X \subseteq \mathbb{N}\) is unbounded. This is achieved by showing that adding \(U_1\) to MSO gives a logic with the same e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2020-02
Hauptverfasser: Bojańczyk, Mikołaj, Daviaud, Laure, Guillon, Bruno, Penelle, Vincent, Sreejith, A V
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Logic programming
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Bojańczyk, Mikołaj
Daviaud, Laure
Guillon, Bruno
Penelle, Vincent
Sreejith, A V
description We prove the undecidability of MSO on \(\omega\)-words extended with the second-order predicate \(U_1(X)\) which says that the distance between consecutive positions in a set \(X \subseteq \mathbb{N}\) is unbounded. This is achieved by showing that adding \(U_1\) to MSO gives a logic with the same expressive power as \(MSO+U\), a logic on \(\omega\)-words with undecidable satisfiability. As a corollary, we prove that MSO on \(\omega\)-words becomes undecidable if allowing to quantify over sets of positions that are ultimately periodic, i.e., sets \(X\) such that for some positive integer \(p\), ultimately either both or none of positions \(x\) and \(x+p\) belong to \(X\).
doi_str_mv 10.48550/arxiv.1807.08506
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1807_08506</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2092812373</sourcerecordid><originalsourceid>FETCH-LOGICAL-a956-afc863aa8482c0707df07fa75fe1e2cf6bc3b333eb9b0c1c363e5f2621d547983</originalsourceid><addsrcrecordid>eNotj0tLAzEUhYMgWGp_gCsHXInMeHPv5DFLKVqFShe265DJJJBaZ2qmrfbf24erA4ePw_kYu-FQlFoIeLTpN-4KrkEVoAXICzZAIp7rEvGKjfp-CQAoFQpBA3a_aBvvYmPruIqbfdaFzGY_3n5mO5_62LXH5v1j9rC4ZpfBrno_-s8hm788z8ev-XQ2eRs_TXNbCZnb4LQka3Wp0YEC1QRQwSoRPPfogqwd1UTk66oGxx1J8iKgRN6IUlWahuz2PHvyMOsUv2zam6OPOfkciLszsU7d99b3G7Pstqk9fDIIFWqOpIj-AMubS4s</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2092812373</pqid></control><display><type>article</type><title>Undecidability of a weak version of MSO+U</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Bojańczyk, Mikołaj ; Daviaud, Laure ; Guillon, Bruno ; Penelle, Vincent ; Sreejith, A V</creator><creatorcontrib>Bojańczyk, Mikołaj ; Daviaud, Laure ; Guillon, Bruno ; Penelle, Vincent ; Sreejith, A V</creatorcontrib><description>We prove the undecidability of MSO on \(\omega\)-words extended with the second-order predicate \(U_1(X)\) which says that the distance between consecutive positions in a set \(X \subseteq \mathbb{N}\) is unbounded. This is achieved by showing that adding \(U_1\) to MSO gives a logic with the same expressive power as \(MSO+U\), a logic on \(\omega\)-words with undecidable satisfiability. As a corollary, we prove that MSO on \(\omega\)-words becomes undecidable if allowing to quantify over sets of positions that are ultimately periodic, i.e., sets \(X\) such that for some positive integer \(p\), ultimately either both or none of positions \(x\) and \(x+p\) belong to \(X\).</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1807.08506</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Logic in Computer Science ; Logic programming</subject><ispartof>arXiv.org, 2020-02</ispartof><rights>2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1807.08506$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.23638/LMCS-16(1:12)2020$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Bojańczyk, Mikołaj</creatorcontrib><creatorcontrib>Daviaud, Laure</creatorcontrib><creatorcontrib>Guillon, Bruno</creatorcontrib><creatorcontrib>Penelle, Vincent</creatorcontrib><creatorcontrib>Sreejith, A V</creatorcontrib><title>Undecidability of a weak version of MSO+U</title><title>arXiv.org</title><description>We prove the undecidability of MSO on \(\omega\)-words extended with the second-order predicate \(U_1(X)\) which says that the distance between consecutive positions in a set \(X \subseteq \mathbb{N}\) is unbounded. This is achieved by showing that adding \(U_1\) to MSO gives a logic with the same expressive power as \(MSO+U\), a logic on \(\omega\)-words with undecidable satisfiability. As a corollary, we prove that MSO on \(\omega\)-words becomes undecidable if allowing to quantify over sets of positions that are ultimately periodic, i.e., sets \(X\) such that for some positive integer \(p\), ultimately either both or none of positions \(x\) and \(x+p\) belong to \(X\).</description><subject>Computer Science - Logic in Computer Science</subject><subject>Logic programming</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj0tLAzEUhYMgWGp_gCsHXInMeHPv5DFLKVqFShe265DJJJBaZ2qmrfbf24erA4ePw_kYu-FQlFoIeLTpN-4KrkEVoAXICzZAIp7rEvGKjfp-CQAoFQpBA3a_aBvvYmPruIqbfdaFzGY_3n5mO5_62LXH5v1j9rC4ZpfBrno_-s8hm788z8ev-XQ2eRs_TXNbCZnb4LQka3Wp0YEC1QRQwSoRPPfogqwd1UTk66oGxx1J8iKgRN6IUlWahuz2PHvyMOsUv2zam6OPOfkciLszsU7d99b3G7Pstqk9fDIIFWqOpIj-AMubS4s</recordid><startdate>20200210</startdate><enddate>20200210</enddate><creator>Bojańczyk, Mikołaj</creator><creator>Daviaud, Laure</creator><creator>Guillon, Bruno</creator><creator>Penelle, Vincent</creator><creator>Sreejith, A V</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20200210</creationdate><title>Undecidability of a weak version of MSO+U</title><author>Bojańczyk, Mikołaj ; Daviaud, Laure ; Guillon, Bruno ; Penelle, Vincent ; Sreejith, A V</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a956-afc863aa8482c0707df07fa75fe1e2cf6bc3b333eb9b0c1c363e5f2621d547983</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Logic in Computer Science</topic><topic>Logic programming</topic><toplevel>online_resources</toplevel><creatorcontrib>Bojańczyk, Mikołaj</creatorcontrib><creatorcontrib>Daviaud, Laure</creatorcontrib><creatorcontrib>Guillon, Bruno</creatorcontrib><creatorcontrib>Penelle, Vincent</creatorcontrib><creatorcontrib>Sreejith, A V</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bojańczyk, Mikołaj</au><au>Daviaud, Laure</au><au>Guillon, Bruno</au><au>Penelle, Vincent</au><au>Sreejith, A V</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Undecidability of a weak version of MSO+U</atitle><jtitle>arXiv.org</jtitle><date>2020-02-10</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>We prove the undecidability of MSO on \(\omega\)-words extended with the second-order predicate \(U_1(X)\) which says that the distance between consecutive positions in a set \(X \subseteq \mathbb{N}\) is unbounded. This is achieved by showing that adding \(U_1\) to MSO gives a logic with the same expressive power as \(MSO+U\), a logic on \(\omega\)-words with undecidable satisfiability. As a corollary, we prove that MSO on \(\omega\)-words becomes undecidable if allowing to quantify over sets of positions that are ultimately periodic, i.e., sets \(X\) such that for some positive integer \(p\), ultimately either both or none of positions \(x\) and \(x+p\) belong to \(X\).</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1807.08506</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2020-02
issn 2331-8422
language eng
recordid cdi_arxiv_primary_1807_08506
source arXiv.org; Free E- Journals
subjects Computer Science - Logic in Computer Science
Logic programming
title Undecidability of a weak version of MSO+U
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T07%3A21%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Undecidability%20of%20a%20weak%20version%20of%20MSO+U&rft.jtitle=arXiv.org&rft.au=Boja%C5%84czyk,%20Miko%C5%82aj&rft.date=2020-02-10&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1807.08506&rft_dat=%3Cproquest_arxiv%3E2092812373%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2092812373&rft_id=info:pmid/&rfr_iscdi=true