Some proofs of independence in axiomatic set theory

Abstract

1. Gödel's theorem that sufficiently strong formal systems cannot prove their own consistency and Tarski's method for constructing truth-definitions can be combined to give several independence results in axiomatic set theory. In substance, the following theorems can be obtained: (a) The existence of inaccessible ordinals is not provable from the axioms of set theory, if these axioms are consistent, (b) The axiom of infinity is independent of the other axioms, if these other axioms are consistent, (c) The axiom of replacement is independent of the other axioms, if these other axioms are consistent. In all cases, V = L will be included as an axiom.The result (a) concerning inaccessible ordinals already has been proved in Shepherdson [10] and Mostowski [6], but their proofs are somewhat different from the one given here. According to Mostowski [6], Kuratowski essentially had a proof of (a) in 1924. Propositions (b) and (c) have been proved, for axiomatic set theory without the axiom V = L, by Bernays [1] pp. 65–69. The method of proof used in this paper is due to Firestone and Rosser [2].An outline of a similar proof along these lines is given in Rosser [7] pp. 60–62.As our system G of set theory, we choose Gödel's system A, B, C, as given in [4], except for the following changes.