A relative consistency proof
- 12 March 1954
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 19 (1) , 21-28
- https://doi.org/10.2307/2267646
Abstract
LetCbe an axiom system formalized within the first order functional calculus, and letC′ be related toCas the Bernays-Gödel set theory is related to the Zermelo-Fraenkel set theory. (An exact definition ofC′ will be given later.) Ilse Novak [5] and Mostowski [8] have shown that, ifCis consistent, thenC′ is consistent. (The converse is obvious.) Mostowski has also proved the stronger result that any theorem ofC′ which can be formalized inCis a theorem ofC.The proofs of Novak and Mostowski do not provide a direct method for obtaining a contradiction inCfrom a contradiction inC′. We could, of course, obtain such a contradiction by proving the theorems ofCone by one; the above result assures us that we must eventually obtain a contradiction. A similar process is necessary to obtain the proof of a theorem inCfrom its proof inC′. The purpose of this paper is to give a new proof of these theorems which provides a direct method of obtaining the desired contradiction or proof.The advantage of the proof may be stated more specifically by arithmetizing the syntax ofCandC′.Keywords
This publication has 7 references indexed in Scilit:
- Mathematical LogicPublished by Harvard University Press ,1951
- A construction for consistent systemsFundamenta Mathematicae, 1950
- On Zermelo's and Von Neumann's Axioms for Set TheoryProceedings of the National Academy of Sciences, 1949
- Introduction to Mathematical Logic. Part IThe Journal of Philosophy, 1944
- Consistency of the Continuum Hypothesis. (AM-3)Published by Walter de Gruyter GmbH ,1940
- New Foundations for Mathematical LogicThe American Mathematical Monthly, 1937
- New Foundations for Mathematical LogicThe American Mathematical Monthly, 1937