default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul E. Howard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Paul E. Howard:
Separablilty of metric measure spaces and choice axioms. Arch. Math. Log. 63(7-8): 987-1003 (2024)- 2023
- [j37]Paul E. Howard
, Eleftherios Tachtsis:
Models of sfZFA in which every linearly ordered set can be well ordered. Arch. Math. Log. 62(7-8): 1131-1157 (2023)
2010 – 2019
- 2017
- [j36]Paul E. Howard, Eleftherios Tachtsis:
On infinite-dimensional Banach spaces and weak forms of the axiom of choice. Math. Log. Q. 63(6): 509-535 (2017) - 2016
- [j35]Paul E. Howard, Eleftherios Tachtsis:
No decreasing sequence of cardinals. Arch. Math. Log. 55(3-4): 415-429 (2016) - [j34]Paul E. Howard, Denis I. Saveliev, Eleftherios Tachtsis:
On the set-theoretic strength of the existence of disjoint cofinal sets in posets without maximal elements. Math. Log. Q. 62(3): 155-176 (2016) - [j33]Horst Herrlich, Paul E. Howard, Eleftherios Tachtsis:
Finiteness Classes and Small Violations of Choice. Notre Dame J. Formal Log. 57(3): 375-388 (2016) - 2014
- [j32]Paul E. Howard, Eleftherios Tachtsis:
On a variant of Rado's selection lemma and its equivalence with the Boolean prime ideal theorem. Arch. Math. Log. 53(7-8): 825-833 (2014) - 2013
- [j31]Paul E. Howard, Eleftherios Tachtsis:
On vector spaces over specific fields without choice. Math. Log. Q. 59(3): 128-146 (2013) - 2011
- [j30]Paul E. Howard:
The finiteness of compact Boolean algebras. Math. Log. Q. 57(1): 14-18 (2011)
2000 – 2009
- 2008
- [j29]Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Unions and the axiom of choice. Math. Log. Q. 54(6): 652-665 (2008) - 2007
- [j28]Paul E. Howard:
Bases, spanning sets, and the axiom of choice. Math. Log. Q. 53(3): 247-254 (2007) - 2005
- [j27]David Blair, Andreas Blass, Paul E. Howard:
Divisibility of Dedekind finite Sets. J. Math. Log. 5(1) (2005) - [j26]Paul E. Howard:
If vector spaces are projective modules then multiple choice holds. Math. Log. Q. 51(2): 187-190 (2005) - [j25]Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Eleftherios Tachtsis:
Properties of the real line and weak forms of the Axiom of Choice. Math. Log. Q. 51(6): 598-609 (2005) - 2003
- [j24]Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Products of compact spaces and the axiom of choice II. Math. Log. Q. 49(1): 57-71 (2003) - [j23]Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Metric spaces and the axiom of choice. Math. Log. Q. 49(5): 455-466 (2003) - 2002
- [j22]Omar De la Cruz, Eric J. Hall, Paul E. Howard, Jean E. Rubin, Adrienne Stanley:
Definitions of Compactness and The Axiom of Choice. J. Symb. Log. 67(1): 143-161 (2002) - [j21]Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Products of Compact Spaces and the Axiom of Choice. Math. Log. Q. 48(4): 508-516 (2002) - 2001
- [j20]Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin, Adrienne Stanley, Eleftherios Tachtsis:
Non-constructive Properties of the Real Numbers. Math. Log. Q. 47(3): 423-431 (2001) - 2000
- [j19]Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin, Adrienne Stanley:
Compactness in Countable Tychonoff Products and Choice. Math. Log. Q. 46(1): 3-16 (2000) - [j18]Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin, Adrienne Stanley:
Paracompactness of Metric Spaces and the Axiom of Multiple Choice. Math. Log. Q. 46(2): 219-232 (2000) - [j17]Paul E. Howard, Jean E. Rubin, Adrienne Stanley:
Von Rimscha's Transitivity Conditions. Math. Log. Q. 46(4): 549-554 (2000)
1990 – 1999
- 1998
- [j16]Paul E. Howard, Kyriakos Keremedis, Herman Rubin, Jean E. Rubin:
Versions of Normality and Some Weak Forms of the Axiom of Choice. Math. Log. Q. 44: 367-382 (1998) - [j15]Paul E. Howard, Kyriakos Keremedis, Herman Rubin, Jean E. Rubin:
Disjoint Unions of Topological Spaces and Choice. Math. Log. Q. 44: 493-508 (1998) - 1996
- [j14]Paul E. Howard, Jean E. Rubin:
The Boolean Prime Ideal Theorem Plus Countable Choice Do Not Imply Dependent Choice. Math. Log. Q. 42: 410-420 (1996) - 1995
- [j13]Paul E. Howard, Jean E. Rubin:
The Axiom of Choice for Well-Ordered Families and for Familes of Well-Orderable Sets. J. Symb. Log. 60(4): 1115-1117 (1995) - 1994
- [j12]Hartmut Höft, Paul E. Howard:
Well Ordered Subsets of Linearly Ordered Sets. Notre Dame J. Formal Log. 35(3): 413-425 (1994) - 1993
- [j11]Paul E. Howard:
Variations of Rado's Lemma. Math. Log. Q. 39: 353-356 (1993) - [j10]Paul E. Howard, Jeffrey Solski:
The Strenght of the Delta-system Lemma. Notre Dame J. Formal Log. 34(1): 100-106 (1993) - 1992
- [j9]Norbert Brunner, Paul E. Howard:
Russell's Alternative to the Axiom of Choice. Math. Log. Q. 38(1): 529-534 (1992) - [j8]Paul E. Howard:
The Axiom of Choice for Countable Collections of Countable Sets Does Not Imply the Countable Union Theorem. Notre Dame J. Formal Log. 33(2): 236-243 (1992) - 1990
- [j7]Paul E. Howard:
Definitions of Compact. J. Symb. Log. 55(2): 645-655 (1990)
1980 – 1989
- 1987
- [j6]Paul E. Howard:
The Existence of Level Sets in a Free Group Implies the Axiom of Choice. Math. Log. Q. 33(4): 315-316 (1987) - [j5]Paul E. Howard, Mary Yorke:
Maximal p-subgroups and the axiom of choice. Notre Dame J. Formal Log. 28(2): 276-283 (1987) - 1985
- [j4]Paul E. Howard:
Subgroups of a Free Group and the Axiom of Choice. J. Symb. Log. 50(2): 458-467 (1985) - 1984
- [j3]Paul E. Howard:
Rado's Selection Lemma Does not Imply the Boolean Prime Ideal Theorem. Math. Log. Q. 30(9-11): 129-132 (1984)
1970 – 1979
- 1978
- [j2]Paul E. Howard, Arthur L. Rubin, Jean E. Rubin:
Independence Results for Class Forms of the Axiom of Choice. J. Symb. Log. 43(4): 673-684 (1978) - 1973
- [j1]Paul E. Howard:
Limitations on the Fraenkel-Mostowski Method of Independence Proofs. J. Symb. Log. 38(3): 416-422 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
