Pavel Pudlak – författare

Visar alla böcker från författaren Pavel Pudlak. Handla med fri frakt och snabb leverans.

5 produkter

Kategorier

5 produkter

Logic Colloquium '98
AvPavel Pudlak,Petr Hajekm. fl.
E-bok
PDF, Engelska
1 499 kr
Läs direkt efter köp
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the thirteenth publication in the Lecture Notes in Logic series, collects the proceedings of the European Summer Meeting of the Association for Symbolic Logic held at the University of Economics in Prague, August 9–15, 1988. It includes surveys and research from preeminent logicians. The papers in this volume range over all areas of mathematical logic, including proof theory, set theory, model theory, computability theory and philosophy. This book will be of interest to all students and researchers in mathematical logic.
Logical Foundations of Mathematics and Computational Complexity
A Gentle Introduction
AvPavel Pudlák
Inbunden, Engelska, 2013
1 964 kr
Skickas inom 10-15 vardagar
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.
Logical Foundations of Mathematics and Computational Complexity
A Gentle Introduction
AvPavel Pudlak
E-bok
PDF, Engelska, 2013
2 543 kr
Läs direkt efter köp
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.
Logical Foundations of Mathematics and Computational Complexity
A Gentle Introduction
AvPavel Pudlák
Häftad, Engelska, 2016
1 964 kr
Skickas inom 10-15 vardagar
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.
Metamathematics of First-Order Arithmetic
AvPetr Hajek,Pavel Pudlak
Häftad, Engelska, 1998
1 417 kr
Skickas inom 10-15 vardagar
People have always been interested in numbers, in particular the natural numbers. Of course, we all have an intuitive notion of what these numbers are. In the late 19th century mathematicians, such as Grassmann, Frege and Dedekind, gave definitions for these familiar objects. Since then the development of axiomatic schemes for arithmetic have played a fundamental role in a logical understanding of mathematics. There has been a need for some time for a monograph on the metamathematics of first-order arithmetic. The aim of the book by Hajek and Pudlak is to cover some of the most important results in the study of a first order theory of the natural numbers, called Peano arithmetic and its fragments (subtheories). The field is quite active, but only a small part of the results has been covered in monographs. This book is divided into three parts. In Part A, the authors develop parts of mathematics and logic in various fragments. Part B is devoted to incompleteness. Part C studies systems that have the induction schema restricted to bounded formulas (Bounded Arithmetic). One highlight of this section is the relation of provability to computational complexity. The study of formal systems for arithmetic is a prerequisite for understanding results such as Gödel's theorems. This book is intended for those who want to learn more about such systems and who want to follow current research in the field. The book contains a bibliography of approximately 1000 items.

Företag, bibliotek eller offentlig verksamhet?

Pavel Pudlak – författare

Logic Colloquium '98

Logical Foundations of Mathematics and Computational Complexity

Logical Foundations of Mathematics and Computational Complexity

Logical Foundations of Mathematics and Computational Complexity

Metamathematics of First-Order Arithmetic

Mina sidor

Mina sidor

Hjälp

Hjälp

Om Bokus

Om Bokus

Populärt

Populärt

Inspiration

Inspiration