𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Finite Model Theory

✍ Scribed by Heinz-Dieter Ebbinghaus, Jârg Flum


Publisher
Springer
Year
1995
Tongue
English
Leaves
336
Series
Perspectives in Mathematical Logic
Edition
1st
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


This is the first edition. The second edition was published in the "Springer Monographs in Mathematics" series in 2005.

The branch of model theory described in the present book and called finite
model theory has its roots in classical model theory but owes its systematic
development to research from complexity theory.
Model theory or the theory of models, as it was first named by Tarski in
1954, may be considered as the part of the semantics of f.Qrmalized languages
that is concerned with the interplay between the syntactic structure of an
axiom system on the one hand and (algebraic, set-theoretic, ... ) properties
of its models on the other hand. As it turned out, first-order language (we
mostly speak of first-order logic) became the most prominent language in this
respect, the reason being that it obeys some fundamental principles such as
the compactness theorem and the completeness theorem. These principles are
valuable modeltheoretic tools and, at the same time, reflect the expressive
weakness of first-order logic. This weakness is the breeding ground for the
freedom which modeltheoretic methods rest upon.

✦ Table of Contents


Front Matter....Pages I-XV
Preliminaries....Pages 1-12
The Ehrenfeucht-FraΓ―ssΓ© Method....Pages 13-35
More on Games....Pages 37-70
0–1 Laws....Pages 71-96
Satisfiability in the Finite....Pages 97-105
Finite Automata and Logic: A Microcosm of Finite Model Theory....Pages 107-118
Descriptive Complexity Theory....Pages 119-163
Logics with Fixed-Point Operators....Pages 165-234
Logic Programs....Pages 235-264
Optimization Problems....Pages 265-274
Quantifiers and Logical Reductions....Pages 275-311
Back Matter....Pages 313-327

✦ Subjects


Mathematical Logic and Foundations; Algorithm Analysis and Problem Complexity; Mathematical Logic and Formal Languages


πŸ“œ SIMILAR VOLUMES


Finite Model Theory
✍ Heinz-Dieter Ebbinghaus, JΓΆrg Flum πŸ“‚ Library πŸ“… 2006 πŸ› Springer 🌐 English

This is a thoroughly revised and enlarged second edition (the first edition was published in the "Perspectives in Mathematical Logic" series in 1995) that presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and

Finite Model Theory
✍ Heinz-Dieter Ebbinghaus and JΓΆrg Flum πŸ“‚ Library πŸ“… 1999/2006 πŸ› Springer 🌐 English

Finite model theory, the model theory of finite structures, has roots in clasΒ­ sical model theory; however, its systematic development was strongly influΒ­ enced by research and questions of complexity theory and of database theory. Model theory or the theory of models, as it was first named by Tarsk

Finite Model Theory
✍ Heinz-Dieter Ebbinghaus, JΓΆrg Flum πŸ“‚ Library πŸ“… 2005 πŸ› Springer 🌐 English
Finite Model Theory
✍ Heinz-Dieter Ebbinghaus, JΓΆrg Flum πŸ“‚ Library πŸ“… 2005 πŸ› Springer 🌐 English
Finite Model Theory
✍ Heinz-Dieter Ebbinghaus, JΓΆrg Flum πŸ“‚ Library πŸ“… 2005 πŸ› Springer 🌐 English
Finite Model Theory
✍ Heinz-Dieter Ebbinghaus, JΓΆrg Flum πŸ“‚ Library πŸ“… 2005 πŸ› Springer 🌐 English