Elements of Finite Model Theory:
This book is an introduction to finite model theory which stresses the computer science origins of the area. In addition to presenting the main techniques for analyzing logics over finite models, the book deals extensively with applications in databases, complexity theory, and formal languages, as w...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2004
|
| Ausgabe: | 1st ed. 2004 |
| Schriftenreihe: | Texts in Theoretical Computer Science. An EATCS Series
|
| Schlagworte: | |
| Online-Zugang: | UBG01 UBY01 Volltext |
| Zusammenfassung: | This book is an introduction to finite model theory which stresses the computer science origins of the area. In addition to presenting the main techniques for analyzing logics over finite models, the book deals extensively with applications in databases, complexity theory, and formal languages, as well as other branches of computer science. It covers Ehrenfeucht-Fraïssé games, locality-based techniques, complexity analysis of logics, including the basics of descriptive complexity, second-order logic and its fragments, connections with finite automata, fixed point logics, finite variable logics, zero-one laws, and embedded finite models, and gives a brief tour of recently discovered applications of finite model theory. This book can be used both as an introduction to the subject, suitable for a one- or two-semester graduate course, or as reference for researchers who apply techniques from logic in computer science |
| Beschreibung: | 1 Online-Ressource (XIV, 318 p. 7 illus) |
| ISBN: | 9783662070031 |
| DOI: | 10.1007/978-3-662-07003-1 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064386 | ||
| 003 | DE-604 | ||
| 005 | 20230427 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662070031 |9 978-3-662-07003-1 | ||
| 024 | 7 | |a 10.1007/978-3-662-07003-1 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-3-662-07003-1 | ||
| 035 | |a (OCoLC)1227483912 | ||
| 035 | |a (DE-599)BVBBV047064386 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-473 | ||
| 082 | 0 | |a 511.3 |2 23 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 910 |0 (DE-625)143270: |2 rvk | ||
| 084 | |a ST 125 |0 (DE-625)143586: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Libkin, Leonid |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Elements of Finite Model Theory |c by Leonid Libkin |
| 250 | |a 1st ed. 2004 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2004 | |
| 300 | |a 1 Online-Ressource (XIV, 318 p. 7 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Texts in Theoretical Computer Science. An EATCS Series | |
| 520 | |a This book is an introduction to finite model theory which stresses the computer science origins of the area. In addition to presenting the main techniques for analyzing logics over finite models, the book deals extensively with applications in databases, complexity theory, and formal languages, as well as other branches of computer science. It covers Ehrenfeucht-Fraïssé games, locality-based techniques, complexity analysis of logics, including the basics of descriptive complexity, second-order logic and its fragments, connections with finite automata, fixed point logics, finite variable logics, zero-one laws, and embedded finite models, and gives a brief tour of recently discovered applications of finite model theory. This book can be used both as an introduction to the subject, suitable for a one- or two-semester graduate course, or as reference for researchers who apply techniques from logic in computer science | ||
| 650 | 4 | |a Mathematical Logic and Foundations | |
| 650 | 4 | |a Mathematical Logic and Formal Languages | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Database Management | |
| 650 | 4 | |a Mathematical logic | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Database management | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Endliche Modelltheorie |0 (DE-588)4615978-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Endlicher Graph |0 (DE-588)4283258-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Finite-Elemente-Methode |0 (DE-588)4017233-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Endliche Modelltheorie |0 (DE-588)4615978-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 2 | |a Finite-Elemente-Methode |0 (DE-588)4017233-8 |D s |
| 689 | 1 | 3 | |a Endlicher Graph |0 (DE-588)4283258-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642059483 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540212027 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783662070048 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-07003-1 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471498 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-662-07003-1 |l UBG01 |p ZDB-2-SCS |q UBG_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-662-07003-1 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182062328971264 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Libkin, Leonid |
| author_facet | Libkin, Leonid |
| author_role | aut |
| author_sort | Libkin, Leonid |
| author_variant | l l ll |
| building | Verbundindex |
| bvnumber | BV047064386 |
| classification_rvk | SK 130 SK 910 ST 125 ST 130 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-3-662-07003-1 (OCoLC)1227483912 (DE-599)BVBBV047064386 |
| 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 | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/978-3-662-07003-1 |
| edition | 1st ed. 2004 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03735nmm a2200721zc 4500</leader><controlfield tag="001">BV047064386</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230427 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662070031</subfield><subfield code="9">978-3-662-07003-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-07003-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-662-07003-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227483912</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064386</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-473</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 910</subfield><subfield code="0">(DE-625)143270:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 125</subfield><subfield code="0">(DE-625)143586:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Libkin, Leonid</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of Finite Model Theory</subfield><subfield code="c">by Leonid Libkin</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2004</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 318 p. 7 illus)</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">Texts in Theoretical Computer Science. An EATCS Series</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book is an introduction to finite model theory which stresses the computer science origins of the area. In addition to presenting the main techniques for analyzing logics over finite models, the book deals extensively with applications in databases, complexity theory, and formal languages, as well as other branches of computer science. It covers Ehrenfeucht-Fraïssé games, locality-based techniques, complexity analysis of logics, including the basics of descriptive complexity, second-order logic and its fragments, connections with finite automata, fixed point logics, finite variable logics, zero-one laws, and embedded finite models, and gives a brief tour of recently discovered applications of finite model theory. This book can be used both as an introduction to the subject, suitable for a one- or two-semester graduate course, or as reference for researchers who apply techniques from logic in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Formal Languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computation by Abstract Devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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="650" ind1="0" ind2="7"><subfield code="a">Endlicher Graph</subfield><subfield code="0">(DE-588)4283258-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Finite-Elemente-Methode</subfield><subfield code="0">(DE-588)4017233-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Finite-Elemente-Methode</subfield><subfield code="0">(DE-588)4017233-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Endlicher Graph</subfield><subfield code="0">(DE-588)4283258-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642059483</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540212027</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783662070048</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-07003-1</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-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471498</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-07003-1</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UBG_Einzelkauf</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.1007/978-3-662-07003-1</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064386 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:34Z |
| institution | BVB |
| isbn | 9783662070031 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471498 |
| oclc_num | 1227483912 |
| open_access_boolean | |
| owner | DE-706 DE-473 DE-BY-UBG |
| owner_facet | DE-706 DE-473 DE-BY-UBG |
| physical | 1 Online-Ressource (XIV, 318 p. 7 illus) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS UBG_Einzelkauf ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Texts in Theoretical Computer Science. An EATCS Series |
| spelling | Libkin, Leonid Verfasser aut Elements of Finite Model Theory by Leonid Libkin 1st ed. 2004 Berlin, Heidelberg Springer Berlin Heidelberg 2004 1 Online-Ressource (XIV, 318 p. 7 illus) txt rdacontent c rdamedia cr rdacarrier Texts in Theoretical Computer Science. An EATCS Series This book is an introduction to finite model theory which stresses the computer science origins of the area. In addition to presenting the main techniques for analyzing logics over finite models, the book deals extensively with applications in databases, complexity theory, and formal languages, as well as other branches of computer science. It covers Ehrenfeucht-Fraïssé games, locality-based techniques, complexity analysis of logics, including the basics of descriptive complexity, second-order logic and its fragments, connections with finite automata, fixed point logics, finite variable logics, zero-one laws, and embedded finite models, and gives a brief tour of recently discovered applications of finite model theory. This book can be used both as an introduction to the subject, suitable for a one- or two-semester graduate course, or as reference for researchers who apply techniques from logic in computer science Mathematical Logic and Foundations Mathematical Logic and Formal Languages Computation by Abstract Devices Algorithm Analysis and Problem Complexity Database Management Mathematical logic Computers Algorithms Database management Algorithmus (DE-588)4001183-5 gnd rswk-swf Endliche Modelltheorie (DE-588)4615978-2 gnd rswk-swf Endlicher Graph (DE-588)4283258-5 gnd rswk-swf Finite-Elemente-Methode (DE-588)4017233-8 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Endliche Modelltheorie (DE-588)4615978-2 s DE-604 Komplexität (DE-588)4135369-9 s Algorithmus (DE-588)4001183-5 s Finite-Elemente-Methode (DE-588)4017233-8 s Endlicher Graph (DE-588)4283258-5 s Erscheint auch als Druck-Ausgabe 9783642059483 Erscheint auch als Druck-Ausgabe 9783540212027 Erscheint auch als Druck-Ausgabe 9783662070048 https://doi.org/10.1007/978-3-662-07003-1 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Libkin, Leonid Elements of Finite Model Theory Mathematical Logic and Foundations Mathematical Logic and Formal Languages Computation by Abstract Devices Algorithm Analysis and Problem Complexity Database Management Mathematical logic Computers Algorithms Database management Algorithmus (DE-588)4001183-5 gnd Endliche Modelltheorie (DE-588)4615978-2 gnd Endlicher Graph (DE-588)4283258-5 gnd Finite-Elemente-Methode (DE-588)4017233-8 gnd Komplexität (DE-588)4135369-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4615978-2 (DE-588)4283258-5 (DE-588)4017233-8 (DE-588)4135369-9 |
| title | Elements of Finite Model Theory |
| title_auth | Elements of Finite Model Theory |
| title_exact_search | Elements of Finite Model Theory |
| title_exact_search_txtP | Elements of Finite Model Theory |
| title_full | Elements of Finite Model Theory by Leonid Libkin |
| title_fullStr | Elements of Finite Model Theory by Leonid Libkin |
| title_full_unstemmed | Elements of Finite Model Theory by Leonid Libkin |
| title_short | Elements of Finite Model Theory |
| title_sort | elements of finite model theory |
| topic | Mathematical Logic and Foundations Mathematical Logic and Formal Languages Computation by Abstract Devices Algorithm Analysis and Problem Complexity Database Management Mathematical logic Computers Algorithms Database management Algorithmus (DE-588)4001183-5 gnd Endliche Modelltheorie (DE-588)4615978-2 gnd Endlicher Graph (DE-588)4283258-5 gnd Finite-Elemente-Methode (DE-588)4017233-8 gnd Komplexität (DE-588)4135369-9 gnd |
| topic_facet | Mathematical Logic and Foundations Mathematical Logic and Formal Languages Computation by Abstract Devices Algorithm Analysis and Problem Complexity Database Management Mathematical logic Computers Algorithms Database management Algorithmus Endliche Modelltheorie Endlicher Graph Finite-Elemente-Methode Komplexität |
| url | https://doi.org/10.1007/978-3-662-07003-1 |
| work_keys_str_mv | AT libkinleonid elementsoffinitemodeltheory |