Zum Inhalt

Axiomatic Thinking II

  • 2022
  • Buch

Über dieses Buch

In dieser zweibändigen Aufsatzsammlung bewerten führende Forscher den Erfolg von Hilberts axiomatischer Methode neu, die nicht nur die Grundlagen für unser Verständnis der modernen Mathematik legte, sondern auch in der Physik, Informatik und anderswo Anwendung fand. Der Titel ist nach David Hilberts bahnbrechendem Vortrag Axiomatisches Denken benannt, der 1917 auf einer Tagung der Schweizerischen Mathematischen Gesellschaft in Zürich gehalten wurde. Dies markierte den Beginn von Hilberts Rückkehr zu seinen Grundlagenstudien, die letztlich zur Etablierung der Beweistheorie als neuen Zweig im entstehenden Feld der mathematischen Logik führten. Hilbert nutzte auch die Gelegenheit, Paul Bernays als seinen wichtigsten Mitarbeiter in der Grundlagenforschung der kommenden Jahre nach Göttingen zurückzuholen. Die Beiträge richten sich an mathematische und philosophische Logiker, aber auch an naturwissenschaftliche Philosophen sowie Physiker und Informatiker mit Interesse an Grundlagen.

Inhaltsverzeichnis

  1. Frontmatter

  2. Logic I(2)

    1. Chapter 1. A Framework for Metamathematics

      Lorenz Halbeisen
      Abstract
      First, we consider Hilbert’s program, focusing on the three different aspect of mathematics called actual mathematics, formal mathematics, and metamathematics. Then, we investigate the relationship between metamathematics and actual mathematics, describe what shall be achieved with metamathematics, and propose a framework for metamathematics.
    2. Chapter 2. Simplified Cut Elimination for Kripke-Platek Set Theory

      Gerhard Jäger
      Abstract
      The purpose of this article is to present a new and simplified cut elimination procedure for \(\textsf{KP}\). We start off from the basic language of set theory and add constants for all elements of the constructible hierarchy up to the Bachmann-Howard ordinal \(\psi (\varepsilon _{\Omega {+}1})\). This enriched language is then used to set up an infinitary proof system \(\textsf{IP}\) whose ordinal-theoretic part is based on a specific notation system \(C(\varepsilon _{\Omega +1},0)\) due to Buchholz and his idea of operator controlled derivations. \(\textsf{KP}\) is embedded into \(\textsf{IP}\) and complete cut elimination for \(\textsf{IP}\) is proved.
    3. Chapter 3. On the Performance of Axiom Systems

      Wolfram Pohlers
      Abstract
      One of the aims of proof theory is to calibrate the strength of axiom systems by invariants. According to Gödel’s discoveries these invariants will in general not be finite but rather transfinite objects. Pioneering work in this direction had been done by Gerhard Gentzen who characterized the axiom system for Peano arithmetic by the transfinite ordinal \({\varepsilon _0}\). In this paper we try to develop a general framework for characterizing ordinals of axiom systems and study to what extend these ordinals embody a measure for their performance.
    4. Chapter 4. Well-Ordering Principles in Proof Theory and Reverse Mathematics

      Michael Rathjen
      Abstract
      Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalbán et al.) and with far-reaching results by proof-theoretic technology (Afshari, Freund, Girard, Rathjen, Thomson, Valencia Vizcaíno, Weiermann et al.), employing deduction search trees and cut elimination theorems in infinitary logics with ordinal bounds in the latter case. At type level 1, the well-ordering principles are of the form
      $$ \text { (*) } ``\text {if}\,X \text { is well-ordered then } \, f(X) \, \text { is well-ordered''} $$
      where f is a standard proof-theoretic function from ordinals to ordinals (such f’s are always dilators). One aim of the paper is to present a general methodology underlying these results that enables one to construct omega-models of particular theories from \((*)\) and even \(\beta \)-models from the type 2 version of \((*)\). As \((*)\) is of complexity \(\Pi ^1_2\) such a principle cannot characterize stronger comprehensions at the level of \(\Pi ^1_1\)-comprehension. This requires a higher order version of \((*)\) that employs ideas from ordinal representation systems with collapsing functions used in impredicative proof theory. The simplest one is the Bachmann construction. Relativizing the latter construction to any dilator f and asserting that this always yields a well-ordering turns out to be equivalent to \(\Pi ^1_1\)-comprehension. This result has been conjectured and a proof strategy adumbrated roughly 10 years ago, but a detailed proof has only been worked out in recent years.
  3. Mathematics II(2)

    1. Chapter 5. Reflections on the Axiomatic Approach to Continuity

      John L. Bell
      Abstract
      In Hilbert’s paper “Axiomatic Thinking”—the published version of his 1917 Zürich talk - he touches on the axiomatic treatment of continuity and, as he puts it, “the dependence of the propositions of a field of knowledge on the axiom of continuity”. By the “axiom of continuity”, Hilbert seems to mean a number of things. In this paper I speculate on the various meanings Hilbert may have ascribed to the term. I focus in particular on interpreting the “axiom of continuity” as the central principal of Synthetic Differential Geometry that all real functions are smooth.
    2. Chapter 6. Abstract Generality, Simplicity, Forgetting, and Discovery

      Colin McLarty
      Abstract
      The paper contrasts two ways of generalizing and gives examples: probably most people think of examples like generalizing Cartesian coordinate geometry to differential manifolds. One kind of structure is replaced by another more complicated but more flexible kind. Call this articulating generalization as it articulates some general assumptions behind an earlier concept. On the other hand, by unifying generalization, I mean simply dropping some assumptions from an earlier concept or theorem. Hilbert, Noether, and Grothendieck were all known for highly non-trivial unifying generalizations.
    3. Chapter 7. Varieties of Infiniteness in the Existence of Infinitely Many Primes

      Victor Pambuccian
      Abstract
      By providing quantifier-free axioms systems, without any form of induction, for a slight variation of Euclid’s proof and for the Goldbach proof for the existence of infinitely many primes, we highlight the fact that there are two distinct and very likely incompatible concepts of infiniteness that are part of the theorems proved. One of them is the concept of cofinality, the other is the concept of equinumerosity with the universe.
    4. Chapter 8. Axiomatics as a Functional Strategy for Complex Proofs: The Case of Riemann Hypothesis

      Jean Petitot
      Abstract
      My purpose is to comment some claims of André Weil (1906–1998) in his letter of March 26, 1940 to his sister Simone, in particular, the following quotation: “it is essential, if mathematics is to stay as a whole, to provide a unification, which absorbs in some simple and general theories all the common substrata of the diverse branches of the science, suppressing what is not so useful and necessary, and leaving intact what is truly the specific detail of each big problem. This is the good one can achieve with axiomatics”. For Weil (and Bourbaki), the main problem was to find “strategies” for finding complex proofs of “big problems”. For that, the dialectic balance between general structures and specific details is crucial. I will focus on the fact that, for these creative mathematicians, the concept of structure is a functional concept, which has always a “strategic” creative function. The “big problem” here is Riemann Hypothesis (RH). Artin, Schmidt, Hasse, and Weil introduced an intermediary third world between, on the one hand, Riemann original hypothesis on the non-trivial zeroes of the zeta function in analytic theory of numbers, and, on the other hand, the algebraic theory of compact Riemman surfaces. The intermediary world is that of projective curves over finite fields of characteristic \(p\ge 2\). RH can be translated in this context and can be proved using sophisticated tools of algebraic geometry (divisors, Riemann-Roch theorem, intersection theory, Severi-Castelnuovo inequality) coupled with the action of Frobenius maps in characteristic \(p\ge 2\). Recently, Alain Connes proposed a new strategy and constructed a new topos theoretic framework à la Grothendieck where Weil’s proof could be transferred by analogy back to the original RH.
  4. Other Sciences III(2)

    1. Chapter 9. What is the Church-Turing Thesis?

      Udi Boker, Nachum Dershowitz
      Abstract
      We aim to put some order to the multiple interpretations of the Church-Turing Thesis and to the different approaches taken to prove or disprove it.
    2. Chapter 10. Axiomatic Thinking in Physics—Essence or Useless Ornament?

      Domenico Giulini
      Abstract
      In the first part of this contribution, I will present aspects and attitudes towards “axiomatic thinking” in various branches of theoretical physics. In the second and more technical part, which is approximately of the same size, I will focus on mathematical results that are relevant for axiomatic schemes of space-time in connection with attempts to axiomatize Special and General Relativity.
    3. Chapter 11. Axiomatic Thinking—Applied to Religion

      Paul Weingartner
      Abstract
      The purpose of the paper is to show that axiomatic thinking can also be applied to religion provided a part of the language used in religion (here called: Religious Discourse) consists of propositions or norms. Although David Hilbert was not concerned with religion when he gave his famous talk “Axiomatisches Denken” in 1917, his published essay (in 1918) treats this topic in such a broad sense that such an application seems appropriate.
      This application is done in the following way: The first part discusses the possibility of applying axiomatic thinking to religion by considering the necessary preconditions to be satisfied for a successful application. The second part discusses the specific logical language that will be used in the application. The third part offers two concrete examples of such an application: a short and preliminary axiomatic theory of omniscience and omnipotence.
Titel
Axiomatic Thinking II
Herausgegeben von
Fernando Ferreira
Reinhard Kahle
Giovanni Sommaruga
Copyright-Jahr
2022
Electronic ISBN
978-3-030-77799-9
Print ISBN
978-3-030-77798-2
DOI
https://doi.org/10.1007/978-3-030-77799-9

Informationen zur Barrierefreiheit für dieses Buch folgen in Kürze. Wir arbeiten daran, sie so schnell wie möglich verfügbar zu machen. Vielen Dank für Ihre Geduld.

    Bildnachweise
    AvePoint Deutschland GmbH/© AvePoint Deutschland GmbH, ams.solutions GmbH/© ams.solutions GmbH, Wildix/© Wildix, arvato Systems GmbH/© arvato Systems GmbH, Ninox Software GmbH/© Ninox Software GmbH, Nagarro GmbH/© Nagarro GmbH, GWS mbH/© GWS mbH, CELONIS Labs GmbH, USU GmbH/© USU GmbH, G Data CyberDefense/© G Data CyberDefense, Vendosoft/© Vendosoft, Kumavision/© Kumavision, Noriis Network AG/© Noriis Network AG, WSW Software GmbH/© WSW Software GmbH, tts GmbH/© tts GmbH, Asseco Solutions AG/© Asseco Solutions AG, AFB Gemeinnützige GmbH/© AFB Gemeinnützige GmbH, Ferrari electronic AG/© Ferrari electronic AG, Doxee AT GmbH/© Doxee AT GmbH , Haufe Group SE/© Haufe Group SE, NTT Data/© NTT Data