LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science最新文献

Gödel’s Incompleteness Theorems Gödel的不完备性定理

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 2019-06-12 DOI: 10.2307/j.ctvc775sx.13

Andrea Iacona

{"title":"Gödel’s Incompleteness Theorems","authors":"Andrea Iacona","doi":"10.2307/j.ctvc775sx.13","DOIUrl":"https://doi.org/10.2307/j.ctvc775sx.13","url":null,"abstract":"In 1931, when he was only 25 years of age, the great Austrian logician Kurt Gödel (1906– 1978) published an epoch-making paper [16] (for an English translation see [8, pp. 5–38]), in which he proved that an effectively definable consistent mathematical theory which is strong enough to prove Peano’s postulates of elementary arithmetic cannot prove its own consistency. In fact, Gödel first established that there always exist sentences φ in the language of Peano Arithmetic which are true, but are undecidable; that is, neither φ nor ¬φ is provable from Peano’s postulates. This is known as Gödel’s First Incompleteness Theorem. This theorem is quite remarkable in its own right because it shows that Peano’s well-known postulates, which by and large are considered as an axiomatic basis for elementary arithmetic, cannot prove all true statements about natural numbers. But Gödel went even further. He showed that his first incompleteness theorem implies that an effectively definable sufficiently strong consistent mathematical theory cannot prove its own consistency. This theorem became known as Gödel’s Second Incompleteness Theorem. Since then the two theorems are referred to as Gödel’s Incompleteness Theorems. They became landmark theorems and had a huge impact on the subsequent development of logic. In order to give more context, we step further back in time. The idea of formalizing logic goes back to the ancient Greek philosophers. One of the first to pursue it was the great German philosopher and mathematician Gottfried Wilhelm Leibniz (1646–1716). His dream was to develop a universal symbolic language, which would reduce all debate to simple calculation. The next major figure in this pursuit was the English mathematician George Boole (1815–1864), who has provided the first successful steps in this direction. This line of research was developed to a great extent by the famous German mathematician and philosopher Gottlob Frege (1848–1925), and reached its peak in the works of Bertrand Russell (1872–1970) and Alfred North Whitehead (1861–1947). Their magnum opus Principia Mathematica [27] has provided relatively simple, yet rigorous formal basis for logic, and became very influential in the development of the twentieth century logic. ∗Mathematical Sciences; Dept. 3MB, Box 30001; New Mexico State University; Las Cruces, NM 88003; gbezhani@nmsu.edu. We recall that a theory is consistent if it does not prove contradiction. More details on the work of Boole, Frege, and Russell and Whitehead can be found on our webpage http://www.cs.nmsu.edu/historical-projects/; see the historical projects [24, 7]. The work of Boole has resulted in an important concept of Boolean algebra, which is discussed in great length in a series of historical projects [3, 2, 1], also available on our webpage.","PeriodicalId":256848,"journal":{"name":"LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115911497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 119

Validity 有效性

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-15347-6_301599

Andrea Iacona

引用次数: 0

Consistency, Soundness, Completeness 一致性，可靠性，完整性

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-64811-4_10

Andrea Iacona

引用次数: 0

First-Order Logic 一阶逻辑

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-64811-4_17

Andrea Iacona

引用次数: 0

Basic Notions 基本概念

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-64811-4_1

Andrea Iacona

引用次数: 0

The Language L q 语言lq

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-64811-4_13

Andrea Iacona

引用次数: 0

The Language L L语言

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-64811-4_5

Andrea Iacona

引用次数: 0

Quantification 量化

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-64811-4_11

Andrea Iacona

引用次数: 70