Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-23T06:24:32.896Z Has data issue: false hasContentIssue false

On the consistency of an axiom of enumerability

Published online by Cambridge University Press:  12 March 2014

Václav Edvard Beneš*
Affiliation:
Millington, New Jersey

Extract

We prove the following theorem: If S is a consistent set of axioms for set theory, among whose consequences are the axioms of pairing and extensionality, and if S′ is the extension of S to all classes of sets of S, then S′ is consistent and remains so upon addition of an axiom expressing that the universal class has a well-ordering wherein every non-initial element has an immediate predecessor.

The basic idea will be use of the denumerable model of S guaranteed by the Skolem-Löwenheim theorem to obtain (i) a model of S′ in the domain of classes of natural numbers, and (ii) a correspondence between representatives (in the model of S′) of sets of S′ and natural numbers. One can then select a class of natural numbers in the model of S′ which will well-order (in the sense of the model of S′) the representatives of sets of S′ according to the numbers corresponding to them.

Specifically, let the formulas of S involve only one kind of variable and the sole predicate ‘ϵ’. The formulas of S′ can be thought of as identical with those of S; but the axioms of S′ will consist of (i) those of S with quantifiers restricted to sets by clauses ‘(∃z)[y ϵ z]’, (ii) those provided by the schema ‘(∃x) ▪ y ϵ xy [(∃z)[y ϵ z] ▪ A]’, where ‘A’ is any formula of S′ in which ‘x is not free, and (iii) the axiom of extensionality.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1955

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Myhill, John, The hypothesis that all classes are nameable, Proceedings of the National Academy of Sciences of the United States of America, vol. 38 (1952), pp. 979981.CrossRefGoogle ScholarPubMed
[2]Wang, Hao, A formal system of logic, this Journal., vol. 15 (1950), pp. 2532.Google Scholar