{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:31Z","timestamp":1759637971237,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T00:00:00Z","timestamp":1444867200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this paper we study the logical aspects of branching automata, as defined\nby Lodaya and Weil. We first prove that the class of languages of finite N-free\nposets recognized by branching automata is closed under complementation. Then\nwe define a logic, named P-MSO as it is a extension of monadic second-order\nlogic with Presburger arithmetic, and show that it is precisely as expressive\nas branching automata. As a consequence of the effectiveness of the\nconstruction of one formalism from the other, the P-MSO theory of the class of\nall finite N-free posets is decidable.<\/jats:p>","DOI":"10.2168\/lmcs-11(4:2)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:40Z","timestamp":1479736000000},"source":"Crossref","is-referenced-by-count":3,"title":["Logic and Branching Automata"],"prefix":"10.46298","volume":"Volume 11, Issue 4","author":[{"given":"Bedon","family":"Nicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2015,10,15]]},"reference":[{"key":"1073:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1603\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1603\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:37Z","timestamp":1681243657000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,15]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(4:2)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1507.02890","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1507.02890","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,10,15]]},"article-number":"1603"}}