Translator Disclaimer
March 2006 Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine’s NF
Thomas Forster
J. Symbolic Logic 71(1): 227-240 (March 2006). DOI: 10.2178/jsl/1140641171

Abstract

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.

Citation

Download Citation

Thomas Forster. "Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine’s NF." J. Symbolic Logic 71 (1) 227 - 240, March 2006. https://doi.org/10.2178/jsl/1140641171

Information

Published: March 2006
First available in Project Euclid: 22 February 2006

zbMATH: 1100.03045
MathSciNet: MR2210064
Digital Object Identifier: 10.2178/jsl/1140641171

Rights: Copyright © 2006 Association for Symbolic Logic

JOURNAL ARTICLE
14 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.71 • No. 1 • March 2006
Back to Top