首页> 外文期刊>Journal of Symbolic Logic >Permutations and wellfoundedness: The true meaning of the bizarre arithmetic of Quine's NF
【24h】

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

机译:排列和有根据:Quine NF奇异算法的真实含义

获取原文
获取原文并翻译 | 示例
       

摘要

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-modets 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 E. Everything here holds also for NFU if the permutations are taken to fix all urelemente.
机译:结果表明,根据NF,许多涉及NF特有的T函数的序数算术断言都等于具有完全合理的ZF-值的断言的某些确定真理-真值-风格含义。例如:存在大小或等级充分的有根据的集合,或者不存在与E的有根据的小的反例。如果采用置换来固定所有尿素,则此处的所有内容也适用于NFU。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号