Options
Undecidability of MSO+U
Date Issued
01-01-2016
Author(s)
Hutchison, David
Kanade, Takeo
Kittler, Josef
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Indian Institute of Technology, Madras
Steffen, Bernhard
Terzopoulos, Demetri
Tygar, Doug
Weikum, Gerhard
Skrzypczak, Michał
Abstract
As explained in Chap. 9, mso+u logic is an extension of mso that allows to express quantitative properties of structures. One of the consequences of the big expressive power of mso+u is that many decision problems about other quantitative formalisms can be reduced to mso+u. An example is the reduction [CL08] of the non-deterministic index problem to a certain boundedness problem that can be further reduced to mso+u on infinite trees. Therefore, decidability of mso+u would be a very desirable result.
Volume
9802 LNCS