東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Introduction to incompleteness = from Gödel's theorems to forcing and the continuum hypothesis /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Introduction to incompleteness/ by Serafim Batzoglou.
其他題名:	from Gödel's theorems to forcing and the continuum hypothesis /
作者:	Batzoglou, Serafim.
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	xi, 302 p. :ill., digital ;24 cm.
內容註:	Part 1: Godel's Theorems -- Formal Axiomatic Systems -- Peano Arithmetic and Recursive Functions -- Godel's Incompleteness Theorems -- Structures, Models, and Satisfaction -- Completeness and Compactness Theorems -- Completeness and Peano Arithmetic -- The Lucas-Penrose Arguments -- Part II: Incompleteness in arithmetic and set theory -- Incompleteness in Finite Combinatorics -- Consistency of PA and E0 Induction -- Set Theory -- Independence of CH--forcing -- Independence of CH--forcing CH and -CH.
Contained By:	Springer Nature eBook
標題:	Gödel's theorem. -
電子資源:	https://doi.org/10.1007/978-3-031-64217-3
ISBN:	9783031642173

Introduction to incompleteness = from Gödel's theorems to forcing and the continuum hypothesis /
Batzoglou, Serafim.

Introduction to incompletenessfrom Gödel's theorems to forcing and the continuum hypothesis /[electronic resource] :by Serafim Batzoglou. - Cham :Springer Nature Switzerland :2024. - xi, 302 p. :ill., digital ;24 cm.

Part 1: Godel's Theorems -- Formal Axiomatic Systems -- Peano Arithmetic and Recursive Functions -- Godel's Incompleteness Theorems -- Structures, Models, and Satisfaction -- Completeness and Compactness Theorems -- Completeness and Peano Arithmetic -- The Lucas-Penrose Arguments -- Part II: Incompleteness in arithmetic and set theory -- Incompleteness in Finite Combinatorics -- Consistency of PA and E0 Induction -- Set Theory -- Independence of CH--forcing -- Independence of CH--forcing CH and -CH.

Incompleteness is a fascinating phenomenon at the intersection of mathematical foundations, computer science, and epistemology that places a limit on what is provable. However, despite its importance, it is often overlooked in the mathematics curricula because it is difficult to teach. This book aims to help bridge this pedagogical gap by providing a complete and accessible technical exposition of incompleteness for a wide audience. The author accomplishes this by making conceptually difficult proofs more approachable by providing intuitive explanations of the main ideas. Care is taken to emphasize the different layers of the mathematical argument - the layer within and the metalayer about an axiomatic system. Structurally, the book efficiently examines key results and arrives at some of the most interesting concepts as quickly as possible. It begins with Gödel's incompleteness theorems before continuing on to challenging concepts in the arithmetized completeness theorem, the Paris-Harrington theorem, and the independence of the continuum hypothesis. Other topics covered include the Lucas-Penrose arguments, ordinals and cardinals, and axiomatic set theory. Additionally, the author's coverage of forcing is a notable addition to the existing literature. Introduction to Incompleteness will be of interest to researchers, students, and instructors looking for a resource to teach this topic. It may also be suitable for self-study. Knowledge of undergraduate-level theoretical mathematics or computer science is required, as well as a familiarity with abstract proofs.

ISBN: 9783031642173

Standard No.: 10.1007/978-3-031-64217-3doiSubjects--Topical Terms:

3753557
Gödel's theorem.

LC Class. No.: QA9.65

Dewey Class. No.: 511.3

Introduction to incompleteness = from Gödel's theorems to forcing and the continuum hypothesis /
LDR:03198nmm a22003615a 4500 001 2388459
003 DE-He213
005 20240831130327.0
006 m d
007 cr nn 008maaau
008 250916s2024 sz s 0 eng d
020 $a 9783031642173 $q (electronic bk.)
020 $a 9783031642166 $q (paper)
024 7 $a 10.1007/978-3-031-64217-3 $2 doi
035 $a 978-3-031-64217-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.65
072 7 $a PBCD $2 bicssc
072 7 $a PBC $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a PBCD $2 thema
072 7 $a PBC $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA9.65 $b .B336 2024
100 1 $a Batzoglou, Serafim. $3 1006228
245 1 0 $a Introduction to incompleteness $h [electronic resource] : $b from Gödel's theorems to forcing and the continuum hypothesis / $c by Serafim Batzoglou.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Birkhäuser, $c 2024.
300 $a xi, 302 p. : $b ill., digital ; $c 24 cm.
347 $a text file $b PDF $2 rda
505 0 $a Part 1: Godel's Theorems -- Formal Axiomatic Systems -- Peano Arithmetic and Recursive Functions -- Godel's Incompleteness Theorems -- Structures, Models, and Satisfaction -- Completeness and Compactness Theorems -- Completeness and Peano Arithmetic -- The Lucas-Penrose Arguments -- Part II: Incompleteness in arithmetic and set theory -- Incompleteness in Finite Combinatorics -- Consistency of PA and E0 Induction -- Set Theory -- Independence of CH--forcing -- Independence of CH--forcing CH and -CH.
520 $a Incompleteness is a fascinating phenomenon at the intersection of mathematical foundations, computer science, and epistemology that places a limit on what is provable. However, despite its importance, it is often overlooked in the mathematics curricula because it is difficult to teach. This book aims to help bridge this pedagogical gap by providing a complete and accessible technical exposition of incompleteness for a wide audience. The author accomplishes this by making conceptually difficult proofs more approachable by providing intuitive explanations of the main ideas. Care is taken to emphasize the different layers of the mathematical argument - the layer within and the metalayer about an axiomatic system. Structurally, the book efficiently examines key results and arrives at some of the most interesting concepts as quickly as possible. It begins with Gödel's incompleteness theorems before continuing on to challenging concepts in the arithmetized completeness theorem, the Paris-Harrington theorem, and the independence of the continuum hypothesis. Other topics covered include the Lucas-Penrose arguments, ordinals and cardinals, and axiomatic set theory. Additionally, the author's coverage of forcing is a notable addition to the existing literature. Introduction to Incompleteness will be of interest to researchers, students, and instructors looking for a resource to teach this topic. It may also be suitable for self-study. Knowledge of undergraduate-level theoretical mathematics or computer science is required, as well as a familiarity with abstract proofs.
650 0 $a Gödel's theorem. $3 3753557
650 1 4 $a Mathematical Logic and Foundations. $3 892656
650 2 4 $a Set Theory. $3 3596414
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-031-64217-3
950 $a Mathematics and Statistics (SpringerNature-11649)