On the strength of a weak variant of the Axiom of Counting

preprint2016arXivOpen access

Abstract

In this paper NFU−AC\mathrm{NFU}^{-\mathrm{AC}} is used to denote Ronald Jensen's modification of Quine's `New Foundations' Set Theory (NF\mathrm{NF}) fortified with a type-level pairing function but without the Axiom of Choice. The axiom AxCount≥\mathrm{AxCount}_\geq is the variant of the Axiom of Counting which asserts that no finite set is smaller than its own set of singletons. This paper shows that NFU−AC+AxCount≥\mathrm{NFU}^{-\mathrm{AC}}+\mathrm{AxCount}_\geq proves the consistency of the Simple Theory of Types with Infinity (TSTI\mathrm{TSTI}). This result implies that NF+AxCount≥\mathrm{NF}+\mathrm{AxCount}_\geq proves that consistency of TSTI\mathrm{TSTI}, and that NFU−AC+AxCount≥\mathrm{NFU}^{-\mathrm{AC}}+\mathrm{AxCount}_\geq proves the consistency of NFU−AC\mathrm{NFU}^{-\mathrm{AC}}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.