Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF

Forster, Thomas (2006) Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF. Journal of Symbolic Logic, 71 (1). pp. 227-240. ISSN 1943-5886

Full text not available from this repository.

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.

Item Type:	Article
Faculty \ School:	Faculty of Arts and Humanities > School of Philosophy (former - to 2014)
Depositing User:	EPrints Services
Date Deposited:	01 Oct 2010 13:57
Last Modified:	15 Aug 2023 12:30
URI:	https://ueaeprints.uea.ac.uk/id/eprint/9669
DOI:	10.2178/jsl/1140641171

Actions (login required)

View Item