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.2018.53
URN: urn:nbn:de:0030-drops-85122
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8512/
Go to the corresponding LIPIcs Volume Portal

Parys, Pawel

Recursion Schemes and the WMSO+U Logic

pdf-format:
LIPIcs-STACS-2018-53.pdf (0.5 MB)

Abstract

We study the weak MSO logic extended by the unbounding quantifier (WMSO+U), expressing the fact that there exist arbitrarily large finite sets satisfying a given property. We prove that it is decidable whether the tree generated by a given higher-order recursion scheme satisfies a given sentence of WMSO+U.

BibTeX - Entry

@InProceedings{parys:LIPIcs:2018:8512,
  author =	{Pawel Parys},
  title =	{{Recursion Schemes and the WMSO+U Logic}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{53:1--53:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Rolf Niedermeier and Brigitte Vall{\'e}e},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8512},
  URN =		{urn:nbn:de:0030-drops-85122},
  doi =		{10.4230/LIPIcs.STACS.2018.53},
  annote =	{Keywords: higher-order recursion schemes, intersection types, WMSO+U logic, boundedness}
}

Keywords: higher-order recursion schemes, intersection types, WMSO+U logic, boundedness
Collection: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Issue Date: 2018
Date of publication: 27.02.2018

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