# Gödel's program for new axioms: why, where, how and what?

@inproceedings{Feferman1996GdelsPF, title={G{\"o}del's program for new axioms: why, where, how and what?}, author={Solomon Feferman}, year={1996} }

Summary. From 1931 until late in his life (at least 1970) Godel called for the pursuit of new axioms for mathematics to settle both undecided number-theoretical propositions (of the form obtained in his incompleteness results) and undecided set-theoretical propositions (in particular CH). As to the nature of these, Godel made a variety of suggestions, but most frequently he emphasized the route of introducing ever higher axioms of infinity. In particular, he speculated (in his 1946 Princeton… Expand

#### 51 Citations

On the Philosophical Relevance of Godel's Incompleteness Theorems

- Philosophy
- 2005

Godel began his 1951 Gibbs Lecture by stating: "Research in the founda tions of mathematics during the past few decades has produced some results which seem to me of interest, not only in themselves,… Expand

Axiomatizing Truth: Why and How?

- 2012

Broadly speaking there are two kinds of theories of truth, philosophical and logical. The philosophical theories of truth go back to the Greeks and forward to the present day. Among these are the… Expand

Gödel's Incompleteness Theorems, Free Will and Mathematical Thought

- 2011

Some have claimed that Gödel’s incompleteness theorems on the formal axiomatic model of mathematical thought can be used to demonstrate that mind is not mechanical, in opposition to a… Expand

1 Gödel , Nagel , minds and machines

- 2008

1. The imbroglio between Nagel and Gödel. Some fifty years ago (1957 to be exact), Ernest Nagel and Kurt Gödel became involved in a contentious exchange about the possible inclusion of Gödel’s… Expand

The Higher Infinite in Proof Theory

- Computer Science
- 1998

The surprising use of ordinal representation systems employing “names” for large cardinals in current proof-theoretic ordinal analyses is the main theme of this paper. Expand

The Search for New Axioms by Peter Koellner

- 2003

The independence results in set theory invite the search for new and justified axioms. In Chapter 1 I set the stage by examining three approaches to justifying the axioms of standard set theory… Expand

Did Gentzen Prove the Consistency of Arithmetic?

- 2017

In 1936, Gerhard Gentzen famously gave a proof of the consistency of Peano arithmetic. There is no disputing that Gentzen provided us with a mathematically valid argument. This paper addresses the… Expand

Are There Absolutely Unsolvable Problems? Gödel's Dichotomy

- Mathematics
- 2006

This is a critical analysis of the first part of Godel's 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Godel's discussion is framed in terms of a… Expand

The constructive Hilbert program and the limits of Martin-lof type theory

- Mathematics
- 2005

Hilbert’s program is one of the truly magnificent projects in the philosophy of mathematics. To carry out this program he founded a new discipline of mathematics, called “Beweistheorie”, which was to… Expand

Tarski ’ s Intuitive Notion of Set

- 2005

Tarski did research on set theory and also used set theory in many of his emblematic writings. Yet his notion of set from the philosophical viewpoint was almost unknown. By studying mostly the… Expand

#### References

SHOWING 1-10 OF 66 REFERENCES

Some Problems and Results Relevant to the Foundations of Set Theory

- Mathematics
- 1966

Publisher Summary This chapter reports on some meta-mathematical results obtained by William P. Hanf (as a solution of a problem suggested by the author) and some mathematical problems involving… Expand

On the Problem of Schemata of Infinity in Axiomatic Set Theory

- Mathematics
- 1976

Publisher Summary This chapter describes Zermelo's set theory that was substantially extended in 1921 when Fraenkel added his axiom of replacement to the original axioms; for, it is this axiom that… Expand

Recent advances in ordinal analysis: pi12 - CA and related systems

- Mathematics, Computer Science
- Bull. Symb. Log.
- 1995

Recent success is reported in obtaining an ordinal analysis for the system of Π2 analysis, which is the subsystem of formal second order arithmetic, Z2, with comprehension confined to Π1-formulae, giving hope for an ordinals analysis of Z2 in the foreseeable future. Expand

Believing the Axioms I

- Mathematics, Computer Science
- J. Symb. Log.
- 1988

§0. Introduction. Ask a beginning philosophy of mathematics student why we believe the theorems of mathematics and you are likely to hear, “because we have proofs!” The more sophisticated might add… Expand

AXIOM SCHEMATA OF STRONG INFINITY IN AXIOMATIC SET THEORY

- Mathematics
- 1960

l Introduction. There are, in general, two main approaches to the introduction of strong infinity assertions to the Zermelo-Fraenkel set theory. The arithmetical approach starts with the regular… Expand

Principles of Proof and Ordinals Implicit in Given Concepts

- Computer Science
- 1970

Godel's incompleteness theorem, with an absolute minimum of assumptions on the details of the distinction, shows the existence of theorems stated in elementary terms that do not have an elementary proof. Expand

Systems of Predicative Analysis, II: Representations of Ordinals

- Mathematics, Computer Science
- J. Symb. Log.
- 1968

The eventual purpose of this paper is to provide certain specific representations of ordinals and develop their basic properties as needed for the proofs of the results announced in [3]. Since the… Expand

The Formal Language of Recursion

- Mathematics, Computer Science
- J. Symb. Log.
- 1989

This is the first of a sequence of papers in which this approach takes recursion to be a fundamental (primitive) process for constructing algorithms, not a derived notion which must be reduced to others—e.g. iteration or application and abstraction. Expand

Systems of Predicative Analysis

- Mathematics, Computer Science
- J. Symb. Log.
- 1964

The authors can never speak sensibly (in the predicative conception) of the "totality" of all sets as a "completed totality" but only as a potential totality whose full content is never fully grasped but only realized in stages. Expand