No label defined (Q4787440)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1849875
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1849875

      Statements

      0 references
      7 January 2003
      0 references
      first-order logic
      0 references
      axioms
      0 references
      rules of inference
      0 references
      computability
      0 references
      incompleteness
      0 references
      This is the first volume of a two-volume work [Volume 2 is reviewed below] aiming to bridge the gap between introductory expositions of logic and set theory, on the one hand, and the research literature in the field of foundations of mathematics, on the other. At the same time, the book opens horizons in several directions, including mathematics, logic, computer science and philosophy. The style used keeps the balance between formal and informal, between logic and intuition. Possible improvements, for a next edition, concern a greater attention to the historical aspects and to the semiotic aspects. For instance, the syntactic and the semantic dimensions of proofs could be supplemented with the pragmatic one, which became more important with the beginning of the use of computer programs in mathematical proofs and with increasing lengths of proofs. It would also be interesting to pay attention to the prespectives opened in this respect by the development of quantum computing. Focused on the form, meaning, use, and limitations of mathematical proofs, the volume contains a preface, two parts, a bibliography, a list of symbols and an index. The first part is called ``Basic logic'' and discusses: first-order languages; a digression into the metatheory: informal induction and recursion; axioms and rules of inference; basic metatheorems; semantics, soundness, completeness, compactness; substructures, diagrams, and applications; defined symbols; computability and non-computability; arithmetic, definability, undefinability, and incompletability; exercises. The second part is entitled ``The second incompleteness theorem'' and includes: Peano arithmetic; a formal \(\beta\)-function, formal primitive recursion; the boldface \(\Delta\) and \(\Sigma\); arithmetization; derivability conditions; fixed points; exercises. For a next edition, we suggest the introduction of G. Chaitin's results concerning Gödel's incompleteness theorem in terms of algorithmic information theory.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references