Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine’s NF
Forster, Thomas
J. Symbolic Logic, Tome 71 (2006) no. 1, p. 227-240 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T-function which is peculiar to NF turn out to be equivalent to the truth-in-certain-permutation-models of assertions which have perfectly sensible ZF-style meanings, such as: the existence of wellfounded sets of great size or rank, or the nonexistence of small counterexamples to the wellfoundedness of ∈. Everything here holds also for NFU if the permutations are taken to fix all urelemente.
Publié le : 2006-03-14
Classification:  
@article{1140641171,
     author = {Forster, Thomas},
     title = {Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF},
     journal = {J. Symbolic Logic},
     volume = {71},
     number = {1},
     year = {2006},
     pages = { 227-240},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1140641171}
}

Forster, Thomas. Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine’s NF. J. Symbolic Logic, Tome 71 (2006) no. 1, pp.  227-240. http://gdmltest.u-ga.fr/item/1140641171/