default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames E. Baumgartner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2004
[j21]Eduardo M. Castillo, Panagiotis G. Simos
, James W. Wheless, James E. Baumgartner, Joshua I. Breier, Rebecca L. Billingsley, Shirin Sarkari, Michele E. Fitzgerald, Andrew C. Papanicolaou:
Integrating sensory and motor mapping in a comprehensive MEG protocol: Clinical validity and replicability. NeuroImage 21(3): 973-983 (2004)- 2001
- [j20]James E. Baumgartner, András Hajnal:
Polarized Partition Relations. J. Symb. Log. 66(2): 811-821 (2001) - 1995
- [j19]James E. Baumgartner:
Ultrafilters on omega. J. Symb. Log. 60(2): 624-639 (1995) - 1993
- [j18]James E. Baumgartner, Saharon Shelah, Simon Thomas:
Maximal Subsets of Infinite Symmetric Groups. Notre Dame J. Formal Log. 34(1): 1-11 (1993) - 1991
- [j17]James E. Baumgartner:
On the Size of Closed Unbounded Sets. Ann. Pure Appl. Log. 54(3): 195-227 (1991) - [j16]James E. Baumgartner, Otmar Spinas:
Independence and Consistency Proofs in Quadratic Form Theory. J. Symb. Log. 56(4): 1195-1211 (1991) - 1990
- [j15]James E. Baumgartner, Jean A. Larson:
A Diamond Example of an Ordinal Graph with No Infinite Paths. Ann. Pure Appl. Log. 47(1): 1-10 (1990) - 1987
- [j14]James E. Baumgartner, Saharon Shelah:
Remarks on superatomic boolean algebras. Ann. Pure Appl. Log. 33: 109-129 (1987) - 1986
- [j13]James E. Baumgartner:
Partition relations for countable topological spaces. J. Comb. Theory A 43(2): 178-195 (1986) - 1985
- [j12]James E. Baumgartner, Peter Lars Dordal:
Adjoining Dominating Functions. J. Symb. Log. 50(1): 94-101 (1985) - 1984
- [j11]James E. Baumgartner:
Generic Graph Construction. J. Symb. Log. 49(1): 234-240 (1984) - [j10]James E. Baumgartner, James M. Henle:
Infinite Subscripts from Infinite Exponents. J. Symb. Log. 49(2): 558-562 (1984) - 1980
- [j9]James E. Baumgartner:
Chains and Antichains in P(omega). J. Symb. Log. 45(1): 85-92 (1980) - 1977
- [j8]James E. Baumgartner, Alan D. Taylor, Stanley Wagon:
On Splitting Stationary Subsets of Large Cardinals. J. Symb. Log. 42(2): 203-214 (1977) - 1976
- [j7]James E. Baumgartner, Karel Prikry:
On a theorem of silver. Discret. Math. 14(1): 17-21 (1976) - [j6]James E. Baumgartner, Leo Harrington, E. M. Kleinberg:
Adding a Closed Unbounded Set. J. Symb. Log. 41(2): 481-482 (1976) - 1975
- [j5]James E. Baumgartner:
Partitioning Vector Spaces. J. Comb. Theory A 18(2): 231-233 (1975) - [j4]James E. Baumgartner:
Canonical Partition Relations. J. Symb. Log. 40(4): 541-554 (1975) - 1974
- [j3]James E. Baumgartner:
Improvement of a Partition Theorem of Erdös and Rado. J. Comb. Theory A 17(1): 134-137 (1974) - [j2]James E. Baumgartner:
A Short Proof of Hindman's Theorem. J. Comb. Theory A 17(3): 384-386 (1974) - [j1]James E. Baumgartner:
The Hanf Number for Complete L omega1, omega -Sentences (Without GCH). J. Symb. Log. 39(3): 575-578 (1974)
Conference and Workshop Papers
- 1999
- [c1]James E. Baumgartner:
Hajnal's contributions to combinatorial set theory and the partition calculus. Set Theory: The Hajnal Conference 1999: 25-30
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 2024-06-10 21:20 CEST 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:
