I consider some early consistency proofs in the Hilbert School (by Ackermann, von Neumann and Herbrand) for fragments of arithmetic, before Goedel's results. The basic questions I shall try to answer are: What did they prove? Where (in what theory) can one prove what they proved? Which present-day formal theories can 'mimic' those contentual proofs, without violating Goedel's theorem on consistency proofs
After a brief flirtation with logicism in 1917--1920, David Hilbert proposed his own program in the ...
The aim of this paper is to describe and analyze the first (1922) of a long series of Hilbert’s work...
From the very dawn of their field, mathematical logicians have historically studied the consistency ...
We consider the rather neglected and difficult consistency proof for a weak fragment of arithmetic (...
We consider the consistency proof for a weak fragment of arithmetic published by von Neumann in 1927...
Proof theory was created early in the 20th century by David Hilbert to prove the consistency of the ...
Hilbert’s program of formalism was undoubtedly a result of many mathematical, logical, and philosoph...
If nowadays “Gentzen’s consistency proof for arithmetic ” is mentioned, one usually refers to [Ge38]...
This work presents some demonstrations of the consistency of classical arithmetic, proven by Gödel...
Abstract. After a brief flirtation with logicism around 1917, David Hilbert proposed his own program...
In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's Programme, were working on con...
But of course a proof inside A of A's consistency offers no security, for if A were inconsisten...
This paper offers an elementary proof that formal arithmetic is consistent. The system that will be ...
Includes bibliographical references (page 32)In this thesis we examine Godel's argument that (1) the...
This paper contains detailed description of two consistency proofs, which state that in the system c...
After a brief flirtation with logicism in 1917--1920, David Hilbert proposed his own program in the ...
The aim of this paper is to describe and analyze the first (1922) of a long series of Hilbert’s work...
From the very dawn of their field, mathematical logicians have historically studied the consistency ...
We consider the rather neglected and difficult consistency proof for a weak fragment of arithmetic (...
We consider the consistency proof for a weak fragment of arithmetic published by von Neumann in 1927...
Proof theory was created early in the 20th century by David Hilbert to prove the consistency of the ...
Hilbert’s program of formalism was undoubtedly a result of many mathematical, logical, and philosoph...
If nowadays “Gentzen’s consistency proof for arithmetic ” is mentioned, one usually refers to [Ge38]...
This work presents some demonstrations of the consistency of classical arithmetic, proven by Gödel...
Abstract. After a brief flirtation with logicism around 1917, David Hilbert proposed his own program...
In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's Programme, were working on con...
But of course a proof inside A of A's consistency offers no security, for if A were inconsisten...
This paper offers an elementary proof that formal arithmetic is consistent. The system that will be ...
Includes bibliographical references (page 32)In this thesis we examine Godel's argument that (1) the...
This paper contains detailed description of two consistency proofs, which state that in the system c...
After a brief flirtation with logicism in 1917--1920, David Hilbert proposed his own program in the ...
The aim of this paper is to describe and analyze the first (1922) of a long series of Hilbert’s work...
From the very dawn of their field, mathematical logicians have historically studied the consistency ...