Logo - springer
Slogan - springer

Mathematics | Logical Foundations of Mathematics and Computational Complexity - A Gentle Introduction

Logical Foundations of Mathematics and Computational Complexity

A Gentle Introduction

Pudlák, Pavel

2013, XIV, 695 p. 49 illus., 4 illus. in color.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$149.00

(net) price for USA

ISBN 978-3-319-00119-7

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$189.00

(net) price for USA

ISBN 978-3-319-00118-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Presents a wide range of results in logic and computational complexity
  • Explains the topic informally and then in more detail for the advanced reader
  • Presents the ideas behind the theoretical concepts

The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Foundations of Mathematics and Computational Complexity covers a broad spectrum of results in logic and set theory that are relevant to the foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as important for foundations as are the more traditional concepts of computability and provability.

Emphasis is on explaining the essence of concepts and the ideas of proofs, rather than presenting precise formal statements and full proofs. Each section starts with concepts and results easily explained, and gradually proceeds to more difficult ones. The notes after each section present some formal definitions, theorems and proofs.

Logical Foundations of Mathematics and Computational Complexity is aimed at graduate students of all fields of mathematics who are interested in logic, complexity and foundations. It will also be of interest for both physicists and philosophers who are curious to learn the basics of logic and complexity theory.

Content Level » Research

Keywords » Complexity of Proofs - Computational Complexity - Foundations of Mathematics - Incompleteness Theorems - Mathematical Logic - Set-Theoretical Foundations

Related subjects » Mathematics - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Foundations.