{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T12:50:07Z","timestamp":1791204607117,"version":"4.2.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,10,31]],"date-time":"2014-10-31T00:00:00Z","timestamp":1414713600000},"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 extend and prove in detail the Finite Rank Theorem for\nconnection matrices of graph parameters definable in Monadic Second Order Logic\nwith counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and\nJ.A. Makowsky (2009). We demonstrate its vast applicability in simplifying\nknown and new non-definability results of graph properties and finding new\nnon-definability results for graph parameters. We also prove a Feferman-Vaught\nTheorem for the logic CFOL, First Order Logic with the modular counting\nquantifiers.<\/jats:p>","DOI":"10.2168\/lmcs-10(4:1)2014","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T07:32:47Z","timestamp":1431934367000},"source":"Crossref","is-referenced-by-count":6,"title":["Connection Matrices and the Definability of Graph Parameters"],"prefix":"10.46298","volume":"Volume 10, Issue 4","author":[{"given":"Tomer","family":"Kotek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johann A.","family":"Makowsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2014,10,31]]},"reference":[{"key":"915:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/731\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/731\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:54:46Z","timestamp":1681242886000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,31]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(4:1)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1308.3654","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1308.3654","asserted-by":"subject"}],"is-part-of":[{"id-type":"doi","id":"10.4230\/lipics.csl.2012","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,31]]},"article-number":"731"}}