Computability, Complexity, Logic

Front Cover
Elsevier, Jul 1, 1989 - Mathematics - 591 pages
0 Reviews
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems.

The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes and classical aspects of these areas, the subject matter has been selected to give priority throughout to the new aspects of traditional questions, results and methods which have developed from the needs or knowledge of computer science and particularly of complexity theory.

It is both a textbook for introductory courses in the above-mentioned disciplines as well as a monograph in which further results of new research are systematically presented and where an attempt is made to make explicit the connections and analogies between a variety of concepts and constructions.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

BOOK ONE ELEMENTARY THEORY OF COMPUTATION
1
BOOK TWO ELEMENTARY PREDICATE LOGIC
335
Bibliography
528

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information