License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2012.411
URN: urn:nbn:de:0030-drops-36871
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3687/
Go to the corresponding LIPIcs Volume Portal


Kotek, Tomer ; Makowsky, Johann A.

Connection Matrices and the Definability of Graph Parameters

pdf-format:
Document 1.pdf (539 KB)


Abstract

In this paper we extend the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with modular counting CMSOL of B. Godlin, T. Kotek and J.A. Makowsky (2008 and 2009), and demonstrate its vast applicability in simplifying known and new non-definability results of graph properties and finding new non-definability results for graph parameters. We also prove a Feferman-Vaught Theorem for the logic CFOL, First Order Logic with the modular counting quantifiers.

BibTeX - Entry

@InProceedings{kotek_et_al:LIPIcs:2012:3687,
  author =	{Tomer Kotek and Johann A. Makowsky},
  title =	{{Connection Matrices and the Definability of Graph Parameters}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{411--425},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{Patrick C{\'e}gielski and Arnaud Durand},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3687},
  URN =		{urn:nbn:de:0030-drops-36871},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.CSL.2012.411},
  annote =	{Keywords: Model theory, finite model theory, graph invariants}
}

Keywords: Model theory, finite model theory, graph invariants
Seminar: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL
Issue Date: 2012
Date of publication: 27.08.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI