Skip to search
Skip to main content
Search in
Keyword
Title (keyword)
Author (keyword)
Subject (keyword)
Title starts with
Subject (browse)
Author (browse)
Author (sorted by title)
Call number (browse)
search for
Search
Advanced Search
Bookmarks
(
0
)
Princeton University Library Catalog
Start over
Cite
Send
to
SMS
Email
EndNote
RefWorks
RIS
Printer
Bookmark
Elements of Finite Model Theory / by Leonid Libkin.
Author
Libkin, Leonid
[Browse]
Format
Book
Language
English
Εdition
1st ed. 2004.
Published/Created
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Description
1 online resource (XIV, 318 p. 7 illus.)
Details
Subject(s)
Mathematical logic
[Browse]
Computers
[Browse]
Algorithms
[Browse]
Database management
[Browse]
Series
Texts in Theoretical Computer Science. An EATCS Series,
[More in this series]
Texts in Theoretical Computer Science. An EATCS Series, 1862-4499
[More in this series]
Summary note
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.
Notes
"With 24 Figures."
Bibliographic references
Includes bibliographical references and index.
Language note
English
Contents
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.
Show 14 more Contents items
ISBN
3-662-07003-0
Doi
10.1007/978-3-662-07003-1
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage.
Read more...
Other views
Staff view
Ask a Question
Suggest a Correction
Report Harmful Language
Supplementary Information
Other versions
Elements of finite model theory / Leonid Libkin.
id
9942866283506421
Elements of finite model theory / Leonid Libkin.
id
SCSB-5093438