Computability, complexity, logic / E. Börger.

By:

Börger, E. (Egon), 1946-

Contributor(s):

ScienceDirect eBooks

Language: English, German Series: Studies in logic and the foundations of mathematics ; v. 128.1989Description: 1 online resource (xx, 592 pages) : illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9780444874061
0444874062
9780080887043
008088704X
128179063X
9781281790637

Uniform titles:

Berechenbarkeit, Komplexität, Logik. English

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Print version:: Computability, complexity, logic.LOC classification:

QA9.59 .B6713 1989eb

Online resources:

Click here to access online

Contents:

Front Cover; Computability, Complexity, Logic; Copyright Page; Contents; Graph of dependencies; Introduction; Terminology and prerequisites; SECTION I: BOOK ONE ELEMENTARY THEORY OF COMPUTATION; SECTION II: BOOK TWO ELEMENTARY PREDICATE LOGIC; Bibliography; Index; List of symbols.

Summary: 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.

Item type:

eBooks

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 6 )

No physical items for this record

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.

Translation of: Berechenbarkeit, Komplexität, Logik.

Includes bibliographical references (pages 529-573) and index.

Print version record.

Elsevier ScienceDirect All Books