Jean E. Rubin

According to our database1, Jean E. Rubin authored at least 19 papers between 1967 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Unions and the axiom of choice.
Math. Log. Q., 2008

2003
Metric spaces and the axiom of choice.
Math. Log. Q., 2003

Products of compact spaces and the axiom of choice II.
Math. Log. Q., 2003

2002
Products of Compact Spaces and the Axiom of Choice.
Math. Log. Q., 2002

Definitions of Compactness and The Axiom of Choice.
J. Symb. Log., 2002

2001
Non-constructive Properties of the Real Numbers.
Math. Log. Q., 2001

2000
Von Rimscha's Transitivity Conditions.
Math. Log. Q., 2000

Paracompactness of Metric Spaces and the Axiom of Multiple Choice.
Math. Log. Q., 2000

Compactness in Countable Tychonoff Products and Choice.
Math. Log. Q., 2000

1998
Disjoint Unions of Topological Spaces and Choice.
Math. Log. Q., 1998

Versions of Normality and Some Weak Forms of the Axiom of Choice.
Math. Log. Q., 1998

1996
The Boolean Prime Ideal Theorem Plus Countable Choice Do Not Imply Dependent Choice.
Math. Log. Q., 1996

1995
The Axiom of Choice for Well-Ordered Families and for Familes of Well-Orderable Sets.
J. Symb. Log., 1995

1993
Weak Forms of the Axiom of Choke and the Generalized Continuum Hypothesis.
Math. Log. Q., 1993

1978
Independence Results for Class Forms of the Axiom of Choice.
J. Symb. Log., 1978

1977
Variations of Zorn's lemma, principles of cofinality, and Hausdorff's maximal principle. II. Class forms.
Notre Dame J. Formal Log., 1977

1976
Variations of Zorn's lemma, principles of cofinality, and Hausdorff's maximal principle. I. Set forms.
Notre Dame J. Formal Log., 1976

1970
Corrigendum to our paper: "A theorem on n-tuples which is equivalent to the well-ordering theorem".
Notre Dame J. Formal Log., 1970

1967
A theorem on n-tuples which is equivalent to the well-ordering theorem.
Notre Dame J. Formal Log., 1967


  Loading...