7 found
Sort by:
  1. P. Howard, J. E. Rubin & Andreas Blass (2005). REVIEWS-Consequences of the Axiom of Choice. Bulletin of Symbolic Logic 11 (1):61-62.
     
    My bibliography  
     
    Export citation  
  2. J. E. Rubin, K. Keremedis & Paul Howard (2001). Non-Constructive Properties of the Real Numbers. Mathematical Logic Quarterly 47 (3):423-431.
    We study the relationship between various properties of the real numbers and weak choice principles.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Paul Howard, K. Keremedis & J. E. Rubin (2000). Compactness in Countable Tychonoff Products and Choice. Mathematical Logic Quarterly 46 (1):3-16.
    We study the relationship between the countable axiom of choice and the Tychonoff product theorem for countable families of topological spaces.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Paul Howard, K. Keremedis & J. E. Rubin (2000). Paracompactness of Metric Spaces and the Axiom of Multiple Choice. Mathematical Logic Quarterly 46 (2):219-232.
    The axiom of multiple choice implies that metric spaces are paracompact but the reverse implication cannot be proved in set theory without the axiom of choice.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Paul Howard, J. E. Rubin & A. Stanley (2000). Von Rimscha's Transitivity Conditions. Mathematical Logic Quarterly 46 (4):549-554.
    In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to “Every set has the same cardinal number as some transitive set”. In set theory without the axiom of choice, we study the deductive strength of this and similar statements introduced by von Rimscha.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. H. Rubin & J. E. Rubin (1970). Corrigendum to Our Paper: ``A Theorem on $N$-Tuples Which is Equivalent to the Well-Ordering Theorem''. Notre Dame Journal of Formal Logic 11 (2):220-220.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. H. Rubin & J. E. Rubin (1967). A Theorem on $N$-Tuples Which is Equivalent to the Well-Ordering Theorem. Notre Dame Journal of Formal Logic 8 (1-2):48-50.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation