Results 1 -
4 of
4
Unfolding finitist arithmetic
, 2010
"... The concept of the (full) unfolding U(S) of a schematic system S is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted S? The program to determine U(S) for various systems S of foundational significan ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
The concept of the (full) unfolding U(S) of a schematic system S is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted S? The program to determine U(S) for various systems S of foundational significance was previously carried out for a system of non-finitist arithmetic, NFA; it was shown that U(NFA) is prooftheoretically equivalent to predicative analysis. In the present paper we work out the unfolding notions for a basic schematic system of finitist arithmetic, FA, and for an extension of that by a form BR of the so-called Bar Rule. It is shown that U(FA) and U(FA + BR) are proof-theoretically equivalent, respectively, to Primitive Recursive Arithmetic, PRA, and to Peano Arithmetic, PA.
The Impact of the Incompleteness Theorems
"... In addition to this being the centenary of Kurt Gödel’s birth, January marked 75 years since the publication (1931) of his stunning incompleteness theorems. Though widely known in one form or another by practicing mathematicians, and generally thought to say something fundamental about the limits an ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In addition to this being the centenary of Kurt Gödel’s birth, January marked 75 years since the publication (1931) of his stunning incompleteness theorems. Though widely known in one form or another by practicing mathematicians, and generally thought to say something fundamental about the limits and potentialities of mathematical knowledge, the actual importance of these results for mathematics is little understood. Nor is this an isolated example among famous results. For example, not long ago, Philip Davis wrote me about what he calls The Paradox of Irrelevance: “There are many math problems that have achieved the cachet of tremendous significance, e.g., Fermat, four-color, Kepler’s packing, Gödel, etc. Of Fermat, I have read: ‘the most famous math problem of all time’. Of Gödel, I have read: ‘the most mathematically significant achievement of the 20th century’. … Yet, these problems have engaged the attention of relatively few research mathematicians—even in pure math. ” What accounts for this disconnect between fame and relevance? Before going into the question for Gödel’s theorems, it should be distinguished in one respect from the other examples mentioned, which in any case form quite a mixed bag. Namely, each of the Fermat, four-color, and Kepler’s packing problems posed a stand-out challenge following extended efforts to settle them; meeting the challenge in each case required new ideas or approaches and intense work, obviously of different degrees. By contrast, Gödel’s theorems were simply unexpected, and their proofs, though requiring novel techniques, were not difficult on the scale of things. Set-Solomon Feferman is professor of mathematics and philosophy, emeritus, at Stanford University. His email address is
Gödel's Incompleteness Theorems: A Revolutionary View of the Nature of Mathematical Pursuits
"... The work of the mathematician Kurt Gödel changed the face of mathematics forever. His famous incompleteness theorem proved that any formalized system of mathematics would always contain statements that were undecidable, showing that there are certain inherent limitations to the way many mathematicia ..."
Abstract
- Add to MetaCart
The work of the mathematician Kurt Gödel changed the face of mathematics forever. His famous incompleteness theorem proved that any formalized system of mathematics would always contain statements that were undecidable, showing that there are certain inherent limitations to the way many mathematicians studies mathematics. This paper provides a history of the mathematical developments that laid the foundation for Gödel's work, describes the unique method used by Gödel to prove his famous incompleteness theorem, and discusses the farreaching mathematical implications thereof. 2 I.
Emergence: an algorithmic formulation
, 2005
"... When the microequations of a dynamical system generate complex macrobehaviour, there can be an explanatory gap between the small-scale and large-scale descriptions of the same system. The microdynamics may be simple, but its relationship to the macrobehaviour may seem impenetrable. This phenomenon, ..."
Abstract
- Add to MetaCart
When the microequations of a dynamical system generate complex macrobehaviour, there can be an explanatory gap between the small-scale and large-scale descriptions of the same system. The microdynamics may be simple, but its relationship to the macrobehaviour may seem impenetrable. This phenomenon, known as emergence, poses problems for the nature of scientific understanding. How do we reconcile two radically different modes of description? Emergence is formulated using the powerful tools of algorithmic information and computational theory. This provides the ground for an extension and generalisation of the phenomenon. Mathematics itself is analysed as an emergent system, linking formalist notions of mathematics as a string manipulation game with the more abstract ideas and proofs that occupy mathematicians. A philosophical problem that has plagued emergence is whether the whole can be more than the sum of its parts. This possibility, known as strong emergence, manifests when emergent macrostructures introduce brand new causal dynamics into a system. A new perspective on this

