Switch to: Citations

Add references

You must login to add references.
  1. Basic Set Theory.William Mitchell - 1981 - Journal of Symbolic Logic 46 (2):417-419.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Relations between some cardinals in the absence of the axiom of choice.Lorenz Halbeisen & Saharon Shelah - 2001 - Bulletin of Symbolic Logic 7 (2):237-261.
    If we assume the axiom of choice, then every two cardinal numbers are comparable, In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible relationships between them, where possible means that the relationship is consistent with the axioms of set theory. Further we investigate the relationships between some other cardinal numbers in specific permutation models and give some results provable without using (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A Note on Weakly Dedekind Finite Sets.Pimpen Vejjajiva & Supakun Panasawatwong - 2014 - Notre Dame Journal of Formal Logic 55 (3):413-417.
    A set $A$ is Dedekind infinite if there is a one-to-one function from $\omega$ into $A$. A set $A$ is weakly Dedekind infinite if there is a function from $A$ onto $\omega$; otherwise $A$ is weakly Dedekind finite. For a set $M$, let $\operatorname{dfin}^{*}$ denote the set of all weakly Dedekind finite subsets of $M$. In this paper, we prove, in Zermelo–Fraenkel set theory, that $|\operatorname{dfin}^{*}|\lt |\mathcal{P}|$ if $\operatorname{dfin}^{*}$ is Dedekind infinite, whereas $|\operatorname{dfin}^{*}|\lt |\mathcal{P}|$ cannot be proved from ZF for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finite-to-one maps.Thomas Forster - 2003 - Journal of Symbolic Logic 68 (4):1251-1253.
    It is shown in ZF (without choice) that if there is a finite-to-one map P(X) → X, then X is finite.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The well‐ordered and well‐orderable subsets of a set.John Truss - 1973 - Mathematical Logic Quarterly 19 (14‐18):211-214.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Consequences of arithmetic for set theory.Lorenz Halbeisen & Saharon Shelah - 1994 - Journal of Symbolic Logic 59 (1):30-40.
    In this paper, we consider certain cardinals in ZF (set theory without AC, the axiom of choice). In ZFC (set theory with AC), given any cardinals C and D, either C ≤ D or D ≤ C. However, in ZF this is no longer so. For a given infinite set A consider $\operatorname{seq}^{1 - 1}(A)$ , the set of all sequences of A without repetition. We compare $|\operatorname{seq}^{1 - 1}(A)|$ , the cardinality of this set, to |P(A)|, the cardinality of (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations