License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2015.249
URN: urn:nbn:de:0030-drops-49181
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/4918/
Go to the corresponding LIPIcs Volume Portal

Colcombet, Thomas ; Manuel, Amaldev

Combinatorial Expressions and Lower Bounds

pdf-format:
18.pdf (0.6 MB)

Abstract

A new paradigm, called combinatorial expressions, for computing functions expressing properties over infinite domains is introduced. The main result is a generic technique, for showing indefinability of
certain functions by the expressions, which uses a result, namely Hales-Jewett theorem, from Ramsey theory. An application of the technique for proving inexpressibility results for logics on metafinite structures is given. Some extensions and normal forms are also presented.

BibTeX - Entry

@InProceedings{colcombet_et_al:LIPIcs:2015:4918,
  author =	{Thomas Colcombet and Amaldev Manuel},
  title =	{{Combinatorial Expressions and Lower Bounds}},
  booktitle =	{32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
  pages =	{249--261},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-78-1},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{30},
  editor =	{Ernst W. Mayr and Nicolas Ollinger},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/4918},
  URN =		{urn:nbn:de:0030-drops-49181},
  doi =		{10.4230/LIPIcs.STACS.2015.249},
  annote =	{Keywords: expressions, lower bound, indefinability}
}

Keywords: expressions, lower bound, indefinability
Collection: 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Issue Date: 2015
Date of publication: 26.02.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI