Undecidability of MSO+U

David Hutchison; Takeo Kanade; Josef Kittler; Jon M. Kleinberg; Friedemann Mattern; John C. Mitchell; Moni Naor; C. Pandu Rangan; Bernhard Steffen; Demetri Terzopoulos; Doug Tygar; Gerhard Weikum; Michał Skrzypczak

doi:https://doi.org/10.1007/978-3-662-52947-8_10

Undecidability of MSO+U

David Hutchison, Takeo Kanade, Josef Kittler, Jon M. Kleinberg, Friedemann Mattern, John C. Mitchell, Moni Naor, C. Pandu Rangan, Bernhard Steffen, Demetri Terzopoulos, Doug Tygar, Gerhard Weikum, Michał Skrzypczak

Department of Computer Science and Applied Mathematics

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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.

Original language	English
Title of host publication	Descriptive Set Theoretic Methods in Automata Theory
Subtitle of host publication	Decidability and Topological Complexity
Publisher	Springer Verlag
Chapter	10
Pages	173-181
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-662-52947-8_10
State	Published - 6 Aug 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9802 LNCS

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-662-52947-8_10

Cite this

Hutchison, D., Kanade, T., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Pandu Rangan, C., Steffen, B., Terzopoulos, D., Tygar, D., Weikum, G., & Skrzypczak, M. (2016). Undecidability of MSO+U. In Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity (pp. 173-181). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9802 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-52947-8_10

@inbook{96ee7a89b5b942e8b32a88a3434d5746,

title = "Undecidability of MSO+U",

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.",

author = "David Hutchison and Takeo Kanade and Josef Kittler and Kleinberg, {Jon M.} and Friedemann Mattern and Mitchell, {John C.} and Moni Naor and {Pandu Rangan}, C. and Bernhard Steffen and Demetri Terzopoulos and Doug Tygar and Gerhard Weikum and Micha{\l} Skrzypczak",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2017.",

year = "2016",

month = aug,

day = "6",

doi = "https://doi.org/10.1007/978-3-662-52947-8_10",

language = "الإنجليزيّة",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "173--181",

booktitle = "Descriptive Set Theoretic Methods in Automata Theory",

address = "ألمانيا",

}

Hutchison, D, Kanade, T, Kittler, J, Kleinberg, JM, Mattern, F, Mitchell, JC, Naor, M, Pandu Rangan, C, Steffen, B, Terzopoulos, D, Tygar, D, Weikum, G & Skrzypczak, M 2016, Undecidability of MSO+U. in Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9802 LNCS, Springer Verlag, pp. 173-181. https://doi.org/10.1007/978-3-662-52947-8_10

Undecidability of MSO+U. / Hutchison, David; Kanade, Takeo; Kittler, Josef et al.
Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag, 2016. p. 173-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9802 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Undecidability of MSO+U

AU - Hutchison, David

AU - Kanade, Takeo

AU - Kittler, Josef

AU - Kleinberg, Jon M.

AU - Mattern, Friedemann

AU - Mitchell, John C.

AU - Naor, Moni

AU - Pandu Rangan, C.

AU - Steffen, Bernhard

AU - Terzopoulos, Demetri

AU - Tygar, Doug

AU - Weikum, Gerhard

AU - Skrzypczak, Michał

PY - 2016/8/6

Y1 - 2016/8/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84990999121&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-662-52947-8_10

DO - https://doi.org/10.1007/978-3-662-52947-8_10

M3 - فصل

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 173

EP - 181

BT - Descriptive Set Theoretic Methods in Automata Theory

PB - Springer Verlag

ER -

Hutchison D, Kanade T, Kittler J, Kleinberg JM, Mattern F, Mitchell JC et al. Undecidability of MSO+U. In Descriptive Set Theoretic Methods in Automata Theory: Decidability and Topological Complexity. Springer Verlag. 2016. p. 173-181. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-662-52947-8_10

Undecidability of MSO+U

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this