Finite and algorithmic model theory /:
"Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play a...
Gespeichert in:
| Weitere Verfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2011.
|
| Schriftenreihe: | London Mathematical Society lecture note series ;
379. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research"--Provided by publisher |
| Beschreibung: | 1 online resource (xi, 341 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. Includes bibliographical references. |
| ISBN: | 9781139127097 1139127098 9780511974960 0511974965 9781139116435 1139116436 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn759112713 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 111031s2011 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d HS0 |d CDX |d E7B |d YDXCP |d UIU |d REDDC |d OCLCQ |d DEBSZ |d CAMBR |d OCLCF |d EBLCP |d MHW |d LTU |d IDEBK |d OCLCQ |d D6H |d AZK |d OCLCQ |d UAB |d OCLCQ |d UKAHL |d OCLCO |d SFB |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ | ||
| 019 | |a 741651325 |a 769341719 |a 961504893 | ||
| 020 | |a 9781139127097 |q (electronic bk.) | ||
| 020 | |a 1139127098 |q (electronic bk.) | ||
| 020 | |a 9780511974960 |q (electronic bk.) | ||
| 020 | |a 0511974965 |q (electronic bk.) | ||
| 020 | |a 9781139116435 | ||
| 020 | |a 1139116436 | ||
| 020 | |z 9780521718202 | ||
| 020 | |z 0521718201 | ||
| 020 | |z 9781139114264 | ||
| 020 | |z 1139114263 | ||
| 035 | |a (OCoLC)759112713 |z (OCoLC)741651325 |z (OCoLC)769341719 |z (OCoLC)961504893 | ||
| 050 | 4 | |a QA9.7 |b .F565 2011eb | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 082 | 7 | |a 511.3/4 |2 22 | |
| 084 | |a MAT018000 |2 bisacsh | ||
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Finite and algorithmic model theory / |c edited by Javier Esparza, Christian Michaux, Charles Steinhorn. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2011. | ||
| 300 | |a 1 online resource (xi, 341 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a London Mathematical Society lecture note series ; |v 379 | |
| 504 | |a Includes bibliographical references and index. | ||
| 520 | |a "Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research"--Provided by publisher | ||
| 504 | |a Includes bibliographical references. | ||
| 505 | 0 | |a Preface / Javier Esparza, Christian Michaux and Charles Steinhorn -- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin -- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche -- Some connections between finite and infinite model theory / Vera Koponen -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto. | |
| 588 | 0 | |a Print version record. | |
| 650 | 0 | |a Finite model theory. |0 http://id.loc.gov/authorities/subjects/sh2007007330 | |
| 650 | 0 | |a Computer science |x Mathematics. |0 http://id.loc.gov/authorities/subjects/sh85042295 | |
| 650 | 6 | |a Théorie des modèles finis. | |
| 650 | 6 | |a Informatique |x Mathématiques. | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a Computer science |x Mathematics |2 fast | |
| 650 | 7 | |a Finite model theory |2 fast | |
| 700 | 1 | |a Esparza, Javier. | |
| 700 | 1 | |a Michaux, Christian. | |
| 700 | 1 | |a Steinhorn, Charles. | |
| 758 | |i has work: |a Finite and algorithmic model theory (Text) |1 https://id.oclc.org/worldcat/entity/E39PCY6XWgWy9chY7qGhTXYxCP |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |t Finite and algorithmic model theory. |d Cambridge ; New York : Cambridge University Press, 2011 |z 9780521718202 |w (DLC) 2010048062 |w (OCoLC)663441246 |
| 830 | 0 | |a London Mathematical Society lecture note series ; |v 379. |0 http://id.loc.gov/authorities/names/n42015587 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=399283 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH13438492 | ||
| 938 | |a Coutts Information Services |b COUT |n 19724621 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL774974 | ||
| 938 | |a ebrary |b EBRY |n ebr10502686 | ||
| 938 | |a EBSCOhost |b EBSC |n 399283 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 329561 | ||
| 938 | |a YBP Library Services |b YANK |n 7205392 | ||
| 938 | |a YBP Library Services |b YANK |n 7235583 | ||
| 938 | |a YBP Library Services |b YANK |n 7302843 | ||
| 938 | |a YBP Library Services |b YANK |n 6943949 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn759112713 |
|---|---|
| _version_ | 1816881774561591296 |
| adam_text | |
| any_adam_object | |
| author2 | Esparza, Javier Michaux, Christian Steinhorn, Charles |
| author2_role | |
| author2_variant | j e je c m cm c s cs |
| author_facet | Esparza, Javier Michaux, Christian Steinhorn, Charles |
| author_sort | Esparza, Javier |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.7 .F565 2011eb |
| callnumber-search | QA9.7 .F565 2011eb |
| callnumber-sort | QA 19.7 F565 42011EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Preface / Javier Esparza, Christian Michaux and Charles Steinhorn -- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin -- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche -- Some connections between finite and infinite model theory / Vera Koponen -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto. |
| ctrlnum | (OCoLC)759112713 |
| dewey-full | 511.3/4 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/4 |
| dewey-search | 511.3/4 |
| dewey-sort | 3511.3 14 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04920cam a2200781 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn759112713</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">111031s2011 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">HS0</subfield><subfield code="d">CDX</subfield><subfield code="d">E7B</subfield><subfield code="d">YDXCP</subfield><subfield code="d">UIU</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCF</subfield><subfield code="d">EBLCP</subfield><subfield code="d">MHW</subfield><subfield code="d">LTU</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">D6H</subfield><subfield code="d">AZK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">741651325</subfield><subfield code="a">769341719</subfield><subfield code="a">961504893</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139127097</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139127098</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511974960</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511974965</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139116435</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139116436</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521718202</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521718201</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781139114264</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1139114263</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)759112713</subfield><subfield code="z">(OCoLC)741651325</subfield><subfield code="z">(OCoLC)769341719</subfield><subfield code="z">(OCoLC)961504893</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.7</subfield><subfield code="b">.F565 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">016000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/4</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Finite and algorithmic model theory /</subfield><subfield code="c">edited by Javier Esparza, Christian Michaux, Charles Steinhorn.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xi, 341 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">379</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research"--Provided by publisher</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Preface / Javier Esparza, Christian Michaux and Charles Steinhorn -- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin -- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche -- Some connections between finite and infinite model theory / Vera Koponen -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Finite model theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2007007330</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85042295</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des modèles finis.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Informatique</subfield><subfield code="x">Mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Logic.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Infinity.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Finite model theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Esparza, Javier.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Michaux, Christian.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Steinhorn, Charles.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Finite and algorithmic model theory (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCY6XWgWy9chY7qGhTXYxCP</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Finite and algorithmic model theory.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 2011</subfield><subfield code="z">9780521718202</subfield><subfield code="w">(DLC) 2010048062</subfield><subfield code="w">(OCoLC)663441246</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">379.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42015587</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=399283</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH13438492</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">19724621</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL774974</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10502686</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">399283</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">329561</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7205392</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7235583</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7302843</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6943949</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn759112713 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:18:04Z |
| institution | BVB |
| isbn | 9781139127097 1139127098 9780511974960 0511974965 9781139116435 1139116436 |
| language | English |
| oclc_num | 759112713 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xi, 341 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | London Mathematical Society lecture note series ; |
| series2 | London Mathematical Society lecture note series ; |
| spelling | Finite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn. Cambridge ; New York : Cambridge University Press, 2011. 1 online resource (xi, 341 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier London Mathematical Society lecture note series ; 379 Includes bibliographical references and index. "Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research"--Provided by publisher Includes bibliographical references. Preface / Javier Esparza, Christian Michaux and Charles Steinhorn -- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin -- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche -- Some connections between finite and infinite model theory / Vera Koponen -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto. Print version record. Finite model theory. http://id.loc.gov/authorities/subjects/sh2007007330 Computer science Mathematics. http://id.loc.gov/authorities/subjects/sh85042295 Théorie des modèles finis. Informatique Mathématiques. MATHEMATICS Logic. bisacsh MATHEMATICS Infinity. bisacsh Computer science Mathematics fast Finite model theory fast Esparza, Javier. Michaux, Christian. Steinhorn, Charles. has work: Finite and algorithmic model theory (Text) https://id.oclc.org/worldcat/entity/E39PCY6XWgWy9chY7qGhTXYxCP https://id.oclc.org/worldcat/ontology/hasWork Print version: Finite and algorithmic model theory. Cambridge ; New York : Cambridge University Press, 2011 9780521718202 (DLC) 2010048062 (OCoLC)663441246 London Mathematical Society lecture note series ; 379. http://id.loc.gov/authorities/names/n42015587 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=399283 Volltext |
| spellingShingle | Finite and algorithmic model theory / London Mathematical Society lecture note series ; Preface / Javier Esparza, Christian Michaux and Charles Steinhorn -- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin -- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche -- Some connections between finite and infinite model theory / Vera Koponen -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto. Finite model theory. http://id.loc.gov/authorities/subjects/sh2007007330 Computer science Mathematics. http://id.loc.gov/authorities/subjects/sh85042295 Théorie des modèles finis. Informatique Mathématiques. MATHEMATICS Logic. bisacsh MATHEMATICS Infinity. bisacsh Computer science Mathematics fast Finite model theory fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh2007007330 http://id.loc.gov/authorities/subjects/sh85042295 |
| title | Finite and algorithmic model theory / |
| title_auth | Finite and algorithmic model theory / |
| title_exact_search | Finite and algorithmic model theory / |
| title_full | Finite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn. |
| title_fullStr | Finite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn. |
| title_full_unstemmed | Finite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn. |
| title_short | Finite and algorithmic model theory / |
| title_sort | finite and algorithmic model theory |
| topic | Finite model theory. http://id.loc.gov/authorities/subjects/sh2007007330 Computer science Mathematics. http://id.loc.gov/authorities/subjects/sh85042295 Théorie des modèles finis. Informatique Mathématiques. MATHEMATICS Logic. bisacsh MATHEMATICS Infinity. bisacsh Computer science Mathematics fast Finite model theory fast |
| topic_facet | Finite model theory. Computer science Mathematics. Théorie des modèles finis. Informatique Mathématiques. MATHEMATICS Logic. MATHEMATICS Infinity. Computer science Mathematics Finite model theory |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=399283 |
| work_keys_str_mv | AT esparzajavier finiteandalgorithmicmodeltheory AT michauxchristian finiteandalgorithmicmodeltheory AT steinhorncharles finiteandalgorithmicmodeltheory |