Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series) - Image 1

£77.03

Springer Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)

Name: Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)
Brand: Springer
Price: 77.08 GBP
Availability: InStock

AI & Machine Learning

Price History & Forecast

Last 35 days • 35 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 35 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £77 (28 days, 80.0%)

Price range: £76 - £77

Price levels: 2 different prices over 35 days

Description

Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE~s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es sentially first-order predicate calculus or its minor extensions.

Key Features

New

Mint Condition

Dispatch same day for order received before 12 noon

Guaranteed packaging

No quibbles returns

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3540212027
Category: Books > Subjects > Computing & Internet > Computer Science > AI & Machine Learning
Domain: Amazon UK
Release Date: 02 July 2004
Listed Since: 15 February 2007

Barcode

No barcode data available

Springer Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Finite Model Theory: Second Edition (Springer Monographs in Mathematics)

Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

Constructive Models (Siberian School of Algebra and Logic)

Introduction to Model Theory (Algebra, Logic and Applications)

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

A Course in Mathematical Logic for Mathematicians: 53 (Graduate Texts in Mathematics, 53)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Logic for Applications (Texts in Computer Science)

Introduction to Model Theory: 15 (Algebra, Logic and Applications)

Language Computability and Formal Language Theory

A Formalization of Set Theory without Variables (Colloquium Publications)

Logic and Combinatorics: Joint Summer Research Conference on Applications of Mathematical Logic to Finite Combinatorics (Contemporary Mathematics)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

The Foundations of Computability Theory

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Formal Languages and Computation: Models and Their Applications

Logics for Databases and Information Systems: 436 (The Springer International Series in Engineering and Computer Science, 436)

Oxford University Press - Fragments of First-Order Logic

Introduction to Databases: From Biological to Spatio-Temporal (Texts in Computer Science)

Many-Dimensional Modal Logics: Theory and Applications (Volume 148) (Studies in Logic and the Foundations of Mathematics, Volume 148)

Handbook of Philosophical Logic: Volume 8

Mathematical Logic and Model Theory: A Brief Introduction: 0 (Universitext)