Graph structure and monadic second-order logic: a language-theoretic approach
The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
2012
|
Schriftenreihe: | Encyclopedia of mathematics and its applications
volume 138 |
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 Volltext |
Zusammenfassung: | The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory |
Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
Beschreibung: | 1 online resource (xiv, 728 pages) |
ISBN: | 9780511977619 |
DOI: | 10.1017/CBO9780511977619 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043940557 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 161206s2012 |||| o||u| ||||||eng d | ||
020 | |a 9780511977619 |c Online |9 978-0-511-97761-9 | ||
024 | 7 | |a 10.1017/CBO9780511977619 |2 doi | |
035 | |a (ZDB-20-CBO)CR9780511977619 | ||
035 | |a (OCoLC)1073618749 | ||
035 | |a (DE-599)BVBBV043940557 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-92 | ||
082 | 0 | |a 511.3 |2 23 | |
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
100 | 1 | |a Courcelle, B. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Graph structure and monadic second-order logic |b a language-theoretic approach |c Bruno Courcelle, Joost Engelfriet |
246 | 1 | 3 | |a Graph Structure & Monadic Second-Order Logic |
264 | 1 | |a Cambridge |b Cambridge University Press |c 2012 | |
300 | |a 1 online resource (xiv, 728 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Encyclopedia of mathematics and its applications |v volume 138 | |
500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
505 | 8 | |a Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index | |
520 | |a The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory | ||
650 | 4 | |a Logic, Symbolic and mathematical / Graphic methods | |
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Endliche Modelltheorie |0 (DE-588)4615978-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 0 | 1 | |a Endliche Modelltheorie |0 (DE-588)4615978-2 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Engelfriet, Joost |e Sonstige |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-89833-1 |
856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511977619 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029349527 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1017/CBO9780511977619 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9780511977619 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804176881248894976 |
---|---|
any_adam_object | |
author | Courcelle, B. |
author_facet | Courcelle, B. |
author_role | aut |
author_sort | Courcelle, B. |
author_variant | b c bc |
building | Verbundindex |
bvnumber | BV043940557 |
classification_rvk | SK 130 SK 890 |
collection | ZDB-20-CBO |
contents | Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index |
ctrlnum | (ZDB-20-CBO)CR9780511977619 (OCoLC)1073618749 (DE-599)BVBBV043940557 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1017/CBO9780511977619 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03501nmm a2200529zcb4500</leader><controlfield tag="001">BV043940557</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511977619</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-97761-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511977619</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511977619</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1073618749</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940557</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Courcelle, B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph structure and monadic second-order logic</subfield><subfield code="b">a language-theoretic approach</subfield><subfield code="c">Bruno Courcelle, Joost Engelfriet</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Graph Structure & Monadic Second-Order Logic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 728 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">volume 138</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical / Graphic methods</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endliche Modelltheorie</subfield><subfield code="0">(DE-588)4615978-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Endliche Modelltheorie</subfield><subfield code="0">(DE-588)4615978-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Engelfriet, Joost</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-89833-1</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511977619</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349527</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511977619</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511977619</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043940557 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:39:13Z |
institution | BVB |
isbn | 9780511977619 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349527 |
oclc_num | 1073618749 |
open_access_boolean | |
owner | DE-12 DE-92 |
owner_facet | DE-12 DE-92 |
physical | 1 online resource (xiv, 728 pages) |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
publishDate | 2012 |
publishDateSearch | 2012 |
publishDateSort | 2012 |
publisher | Cambridge University Press |
record_format | marc |
series2 | Encyclopedia of mathematics and its applications |
spelling | Courcelle, B. Verfasser aut Graph structure and monadic second-order logic a language-theoretic approach Bruno Courcelle, Joost Engelfriet Graph Structure & Monadic Second-Order Logic Cambridge Cambridge University Press 2012 1 online resource (xiv, 728 pages) txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications volume 138 Title from publisher's bibliographic system (viewed on 05 Oct 2015) Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory Logic, Symbolic and mathematical / Graphic methods Graphentheorie (DE-588)4113782-6 gnd rswk-swf Endliche Modelltheorie (DE-588)4615978-2 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Endliche Modelltheorie (DE-588)4615978-2 s 1\p DE-604 Engelfriet, Joost Sonstige oth Erscheint auch als Druckausgabe 978-0-521-89833-1 https://doi.org/10.1017/CBO9780511977619 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Courcelle, B. Graph structure and monadic second-order logic a language-theoretic approach Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index Logic, Symbolic and mathematical / Graphic methods Graphentheorie (DE-588)4113782-6 gnd Endliche Modelltheorie (DE-588)4615978-2 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4615978-2 |
title | Graph structure and monadic second-order logic a language-theoretic approach |
title_alt | Graph Structure & Monadic Second-Order Logic |
title_auth | Graph structure and monadic second-order logic a language-theoretic approach |
title_exact_search | Graph structure and monadic second-order logic a language-theoretic approach |
title_full | Graph structure and monadic second-order logic a language-theoretic approach Bruno Courcelle, Joost Engelfriet |
title_fullStr | Graph structure and monadic second-order logic a language-theoretic approach Bruno Courcelle, Joost Engelfriet |
title_full_unstemmed | Graph structure and monadic second-order logic a language-theoretic approach Bruno Courcelle, Joost Engelfriet |
title_short | Graph structure and monadic second-order logic |
title_sort | graph structure and monadic second order logic a language theoretic approach |
title_sub | a language-theoretic approach |
topic | Logic, Symbolic and mathematical / Graphic methods Graphentheorie (DE-588)4113782-6 gnd Endliche Modelltheorie (DE-588)4615978-2 gnd |
topic_facet | Logic, Symbolic and mathematical / Graphic methods Graphentheorie Endliche Modelltheorie |
url | https://doi.org/10.1017/CBO9780511977619 |
work_keys_str_mv | AT courcelleb graphstructureandmonadicsecondorderlogicalanguagetheoreticapproach AT engelfrietjoost graphstructureandmonadicsecondorderlogicalanguagetheoreticapproach AT courcelleb graphstructuremonadicsecondorderlogic AT engelfrietjoost graphstructuremonadicsecondorderlogic |