UID:
almahu_9948621037402882
Format:
XIV, 318 p. 7 illus.
,
online resource.
Edition:
1st ed. 2004.
ISBN:
9783662070031
Series Statement:
Texts in Theoretical Computer Science. An EATCS Series,
Content:
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.
Note:
1 Introduction -- 2 Preliminaries -- 3 Ehrenfeucht-Fraïssé Games -- 4 Locality and Winning Games -- 5 Ordered Structures -- 6 Complexity of First-Order Logic -- 7 Monadic Second-Order Logic and Automata -- 8 Logics with Counting -- 9 Turing Machines and Finite Models -- 10 Fixed Point Logics and Complexity Classes -- 11 Finite Variable Logics -- 12 Zero-One Laws -- 13 Embedded Finite Models -- 14 Other Applications of Finite Model Theory -- References -- List of Notation -- Name Index.
In:
Springer Nature eBook
Additional Edition:
Printed edition: ISBN 9783642059483
Additional Edition:
Printed edition: ISBN 9783540212027
Additional Edition:
Printed edition: ISBN 9783662070048
Language:
English
DOI:
10.1007/978-3-662-07003-1
URL:
https://doi.org/10.1007/978-3-662-07003-1
Bookmarklink
