Switch to: References

Add citations

You must login to add citations.
  1. The power set and the set of permutations with finitely many non‐fixed points of a set.Guozhen Shen - 2023 - Mathematical Logic Quarterly 69 (1):40-45.
    For a cardinal, we write for the cardinality of the set of permutations with finitely many non‐fixed points of a set which is of cardinality. We investigate the relationships between and for an arbitrary infinite cardinal in (without the axiom of choice). It is proved in that for all infinite cardinals, and we show that this is the best possible result.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The cardinality of the partitions of a set in the absence of the Axiom of Choice.Palagorn Phansamdaeng & Pimpen Vejjajiva - 2023 - Logic Journal of the IGPL 31 (6):1225-1231.
    In the Zermelo–Fraenkel set theory (ZF), |$|\textrm {fin}(A)|<2^{|A|}\leq |\textrm {Part}(A)|$| for any infinite set |$A$|⁠, where |$\textrm {fin}(A)$| is the set of finite subsets of |$A$|⁠, |$2^{|A|}$| is the cardinality of the power set of |$A$| and |$\textrm {Part}(A)$| is the set of partitions of |$A$|⁠. In this paper, we show in ZF that |$|\textrm {fin}(A)|<|\textrm {Part}_{\textrm {fin}}(A)|$| for any set |$A$| with |$|A|\geq 5$|⁠, where |$\textrm {Part}_{\textrm {fin}}(A)$| is the set of partitions of |$A$| whose members are finite. We (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The permutations with N_ non-fixed points and the sequences with length _N of a set.Jukkrid Nuntasri & Pimpen Vejjajiva - forthcoming - Journal of Symbolic Logic:1-10.
    We write$\mathcal {S}_n(A)$for the set of permutations of a setAwithnnon-fixed points and$\mathrm {{seq}}^{1-1}_n(A)$for the set of one-to-one sequences of elements ofAwith lengthnwherenis a natural number greater than$1$. With the Axiom of Choice,$|\mathcal {S}_n(A)|$and$|\mathrm {{seq}}^{1-1}_n(A)|$are equal for all infinite setsA. Among our results, we show, in ZF, that$|\mathcal {S}_n(A)|\leq |\mathrm {{seq}}^{1-1}_n(A)|$for any infinite setAif${\mathrm {AC}}_{\leq n}$is assumed and this assumption cannot be removed. In the other direction, we show that$|\mathrm {{seq}}^{1-1}_n(A)|\leq |\mathcal {S}_{n+1}(A)|$for any infinite setAand the subscript$n+1$cannot be reduced ton. Moreover, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Cantor’s Theorem May Fail for Finitary Partitions.Guozhen Shen - forthcoming - Journal of Symbolic Logic:1-18.
    A partition is finitary if all its members are finite. For a set A, $\mathscr {B}(A)$ denotes the set of all finitary partitions of A. It is shown consistent with $\mathsf {ZF}$ (without the axiom of choice) that there exist an infinite set A and a surjection from A onto $\mathscr {B}(A)$. On the other hand, we prove in $\mathsf {ZF}$ some theorems concerning $\mathscr {B}(A)$ for infinite sets A, among which are the following: (1) If there is a finitary (...)
    Download  
     
    Export citation  
     
    Bookmark