Finite and Algorithmic Model Theory -

Finite and Algorithmic Model Theory

Buch | Softcover
356 Seiten
2011
Cambridge University Press (Verlag)
978-0-521-71820-2 (ISBN)
75,95 inkl. MwSt
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. The chapters include extensive bibliographies.
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.

Javier Esparza has held the Chair for Foundations of Software Reliability and Theoretical Computer Science at the Technische Universität München since 2007. Christian Michaux has held the Chair of Mathematical Logic at the University of Mons (UMONS, formerly Université de Mons-Hainaut) since 2000. He is currently Dean of the Faculty of Sciences. Charles Steinhorn is Professor of Mathematics at Vassar College, where he has served as Chair of the Mathematics Department and Associate Dean of the Faculty.

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; Algorithmic meta-theorems Stephan Kreutzer; Definability in classes of finite structures H. Dugald Macpherson and Charles Steinhorn; Model theoretic methods for fragments of FO and special classes of (finite) structures Martin Otto.

Erscheint lt. Verlag 10.3.2011
Reihe/Serie London Mathematical Society Lecture Note Series
Zusatzinfo 25 Halftones, black and white; 30 Line drawings, black and white
Verlagsort Cambridge
Sprache englisch
Maße 153 x 226 mm
Gewicht 520 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Allgemeines / Lexika
ISBN-10 0-521-71820-1 / 0521718201
ISBN-13 978-0-521-71820-2 / 9780521718202
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99