Factorials of infinite cardinals in zf part II: Consistency results

Journal of Symbolic Logic 85 (1):244-270 (2020)
  Copy   BIBTEX

Abstract

For a set x, let S(x) be the set of all permutations of x. We prove by the method of permutation models that the following statements are consistent with ZF: (1) There is an infinite set x such that |p(x)|<|S(x)|<|seq^1-1(x)|<|seq(x)|, where p(x) is the powerset of x, seq(x) is the set of all finite sequences of elements of x, and seq^1-1(x) is the set of all finite sequences of elements of x without repetition. (2) There is a Dedekind infinite set x such that |S(x)|<|[x]^3| and such that there exists a surjection from x onto S(x). (3) There is an infinite set x such that there is a finite-to-one function from S(x) into x.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,335

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Generalizations of Cantor's theorem in ZF.Guozhen Shen - 2017 - Mathematical Logic Quarterly 63 (5):428-436.
Flat sets.Arthur D. Grainger - 1994 - Journal of Symbolic Logic 59 (3):1012-1021.
Non‐discrete metrics in and some notions of finiteness.Kyriakos Keremedis - 2016 - Mathematical Logic Quarterly 62 (4-5):383-390.
Splitting stationary sets in.Toshimichi Usuba - 2012 - Journal of Symbolic Logic 77 (1):49-62.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
A geometric zero-one law.Robert H. Gilman, Yuri Gurevich & Alexei Miasnikov - 2009 - Journal of Symbolic Logic 74 (3):929-938.

Analytics

Added to PP
2019-11-05

Downloads
35 (#510,088)

6 months
9 (#667,666)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references