{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:00Z","timestamp":1725566220610},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_9","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"96-107","source":"Crossref","is-referenced-by-count":1,"title":["On Decidability of MSO Theories of Representable Matroids"],"prefix":"10.1007","author":[{"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Seese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy Problems for Tree-Decomposable Graphs. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"key":"9_CR2","unstructured":"Courcelle, B.: The decidability of the monadic second order theory of certain sets of finite and infinite graphs. In: Logic in Computer Science, LICS 1988, Edinburg (1988)"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs I. Recognizable sets of Finite Graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Recognizable sets of Finite Graphs. Information and Computation"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-218X(94)90019-1","volume":"54","author":"B. Courcelle","year":"1994","unstructured":"Courcelle, B.: The monadic second order logic of graphs VI: on several representations of graphs by relational structures. Discrete Appl. Math.\u00a054, 117\u2013149 (1994); Erratum 63, 199\u2013200 (1995)","journal-title":"Discrete Appl. Math."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00578-9","volume":"299","author":"B. Courcelle","year":"2003","unstructured":"Courcelle, B.: The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantification. Theoretical Computer Science\u00a0299, 1\u201336 (2003)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs XV: On a Conjecture by D. Seese, LaBri, Bordeaux 1 University, March 8, 1\u201340 (2004) (manuscript)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory Comput. Systems"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci.\u00a0109, 49\u201382 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2355-7","volume-title":"Mathematical Logic","author":"H.-D. Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer, Heidelberg (1994)","edition":"2"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1006\/jctb.2001.2082","volume":"84","author":"J.F. Geelen","year":"2002","unstructured":"Geelen, J.F., Gerards, A.H.M., Whittle, G.P.: Branch-Width and Well-Quasi-Ordering in Matroids and Graphs. J. Combin. Theory Ser. B\u00a084, 270\u2013290 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9_CR11","unstructured":"Geelen, J.F., Gerards, A.H.M., Whittle, G.P.: Excluding a Planar Graph from a GF(q)-Representable Matroid (2003) (manuscript)"},{"key":"9_CR12","first-page":"479","volume-title":"Model-Theoretic Logics","author":"Y. Gurevich","year":"1985","unstructured":"Gurevich, Y.: Monadic second-order theories. In: Model-Theoretic Logics, ch.\u00a0XIII, pp. 479\u2013506. Springer, New York (1985)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-36494-3_29","volume-title":"STACS 2003","author":"P. Hlin\u011bn\u00fd","year":"2003","unstructured":"Hlin\u011bn\u00fd, P.: Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 319\u2013330. Springer, Heidelberg (2003)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-540-45138-9_41","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P. Hlin\u011bn\u00fd","year":"2003","unstructured":"Hlin\u011bn\u00fd, P.: On Matroid Properties Definable in the MSO Logic. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 470\u2013479. Springer, Heidelberg (2003)"},{"key":"9_CR15","unstructured":"Hlin\u011bn\u00fd, P., Whittle, G.P.: Matroid Tree-Width. In: Extended abstract in: Eurocomb 2003, Charles University, Prague, Czech Republic. ITI Series 2003\u2013145, pp. 202\u2013205 (2003) (submitted)"},{"key":"9_CR16","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"9_CR17","first-page":"58","volume-title":"Logic, Methodology and Philosophy of Sciences 1","author":"M.O. Rabin","year":"1964","unstructured":"Rabin, M.O.: A simple method for undecidability proofs and some applications. In: Bar-Hillel (ed.) Logic, Methodology and Philosophy of Sciences 1, pp. 58\u201368. North-Holland, Amsterdam (1964)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0049-237X(08)71116-9","volume-title":"Handbook of Mathematical Logic, J. Barwise","author":"M.O. Rabin","year":"1977","unstructured":"Rabin, M.O.: Decidable theories. In: Handbook of Mathematical Logic, J. Barwise, ch.\u00a0C.3, pp. 595\u2013629. North-Holland Publ.Co., Amsterdam (1977)"},{"key":"9_CR19","first-page":"153","volume-title":"Graph Minors \u2013 A Survey, Surveys in Combinatorics","author":"N. Robertson","year":"1985","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors \u2013 A Survey, Surveys in Combinatorics, pp. 153\u2013171. Cambridge Univ. Press, Cambridge (1985)"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors X. Obstructions to Tree-Decomposition. J. Combin. Theory Ser. B\u00a052, 153\u2013190 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9_CR21","first-page":"772","volume":"6","author":"D. Seese","year":"1975","unstructured":"Seese, D.: Ein Unentscheidbarkeitskriterium, Wissenschaftliche Zeitschrift der Humboldt-Universitaet zu Berlin. Math.-Nat. R. XXIV\u00a06, 772\u2013778 (1975)","journal-title":"Math.-Nat. R. XXIV"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0168-0072(91)90054-P","volume":"53","author":"D. Seese","year":"1991","unstructured":"Seese, D.: The structure of the models of decidable monadic theories of graphs. Annals of Pure and Aplied Logic\u00a053, 169\u2013195 (1991)","journal-title":"Annals of Pure and Aplied Logic"},{"key":"9_CR23","first-page":"83","volume-title":"Tree Automata and Languages","author":"D. Seese","year":"1992","unstructured":"Seese, D.: Interpretability and Tree Automata: a simple way to solve Algorithmic Problems on Graphs closely related to Trees. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 83\u2013114. Elsevier Sceince Publishers, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:01Z","timestamp":1620012601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}