Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • 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  
  • A Generalized Cantor Theorem In.Yinhe Peng & Guozhen Shen - 2024 - Journal of Symbolic Logic 89 (1):204-210.
    It is proved in $\mathsf {ZF}$ (without the axiom of choice) that, for all infinite sets M, there are no surjections from $\omega \times M$ onto $\operatorname {\mathrm {\mathscr {P}}}(M)$.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Note on Strongly Almost Disjoint Families.Guozhen Shen - 2020 - Notre Dame Journal of Formal Logic 61 (2):227-231.
    For a set M, let |M| denote the cardinality of M. A family F is called strongly almost disjoint if there is an n∈ω such that |A∩B|<n for any two distinct elements A, B of F. It is shown in ZF (without the axiom of choice) that, for all infinite sets M and all strongly almost disjoint families F⊆P(M), |F|<|P(M)| and there are no finite-to-one functions from P(M) into F, where P(M) denotes the power set of M.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Remarks on infinite factorials and cardinal subtraction in ZF$\mathsf{ZF}$.Guozhen Shen - 2022 - Mathematical Logic Quarterly 68 (1):67-73.
    The factorial of a cardinal, denoted by, is the cardinality of the set of all permutations of a set which is of cardinality. We give a condition that makes the cardinal equality provable without the axiom of choice. In fact, we prove in that, for all cardinals, if and there is a permutation without fixed points on a set which is of cardinality, then.
    Download  
     
    Export citation  
     
    Bookmark  
  • The permutations with N non-fixed points and the sequences with length N of a set.Jukkrid Nuntasri & Pimpen Vejjajiva - 2024 - Journal of Symbolic Logic 89 (3):1067-1076.
    We write $\mathcal {S}_n(A)$ for the set of permutations of a set A with n non-fixed points and $\mathrm {{seq}}^{1-1}_n(A)$ for the set of one-to-one sequences of elements of A with length n where n is 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 sets A. Among our results, we show, in ZF, that $|\mathcal {S}_n(A)|\leq |\mathrm {{seq}}^{1-1}_n(A)|$ for any infinite set A if ${\mathrm {AC}}_{\leq n}$ is (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations