# Paul E. Howard

Orcid: 0000-0001-8649-0511
According to our database

Collaborative distances:

^{1}, Paul E. Howard authored at least 37 papers between 1973 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

Arch. Math. Log., November, 2023

2017

Math. Log. Q., 2017

2016

Notre Dame J. Formal Log., 2016

On the set-theoretic strength of the existence of disjoint cofinal sets in posets without maximal elements.

Math. Log. Q., 2016

Arch. Math. Log., 2016

2014

On a variant of Rado's selection lemma and its equivalence with the Boolean prime ideal theorem.

Arch. Math. Log., 2014

2013

Math. Log. Q., 2013

2011

Math. Log. Q., 2011

2008

Math. Log. Q., 2008

2007

Math. Log. Q., 2007

2005

Math. Log. Q., 2005

Math. Log. Q., 2005

J. Math. Log., 2005

2003

Math. Log. Q., 2003

Math. Log. Q., 2003

2002

Math. Log. Q., 2002

J. Symb. Log., 2002

2001

Math. Log. Q., 2001

2000

Math. Log. Q., 2000

Math. Log. Q., 2000

Math. Log. Q., 2000

1998

Math. Log. Q., 1998

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

1994

Notre Dame J. Formal Log., 1994

1993

Notre Dame J. Formal Log., 1993

Math. Log. Q., 1993

1992

The Axiom of Choice for Countable Collections of Countable Sets Does Not Imply the Countable Union Theorem.

Notre Dame J. Formal Log., 1992

Math. Log. Q., 1992

1990

J. Symb. Log., 1990

1987

Notre Dame J. Formal Log., 1987

Math. Log. Q., 1987

1985

J. Symb. Log., 1985

1984

Math. Log. Q., 1984

1978

J. Symb. Log., 1978

1973

J. Symb. Log., 1973