James E. Baumgartner

According to our database1, James E. Baumgartner authored at least 22 papers between 1974 and 2004.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2004
Integrating sensory and motor mapping in a comprehensive MEG protocol: Clinical validity and replicability.
NeuroImage, 2004

2001
Polarized Partition Relations.
J. Symb. Log., 2001

1999
Hajnal's contributions to combinatorial set theory and the partition calculus.
Proceedings of the Set Theory: The Hajnal Conference, 1999

1995
Ultrafilters on omega.
J. Symb. Log., 1995

1993
Maximal Subsets of Infinite Symmetric Groups.
Notre Dame J. Formal Log., 1993

1991
Independence and Consistency Proofs in Quadratic Form Theory.
J. Symb. Log., 1991

On the Size of Closed Unbounded Sets.
Ann. Pure Appl. Log., 1991

1990
A Diamond Example of an Ordinal Graph with No Infinite Paths.
Ann. Pure Appl. Log., 1990

1987
Remarks on superatomic boolean algebras.
Ann. Pure Appl. Log., 1987

1986
Partition relations for countable topological spaces.
J. Comb. Theory A, 1986

1985
Adjoining Dominating Functions.
J. Symb. Log., 1985

1984
Infinite Subscripts from Infinite Exponents.
J. Symb. Log., 1984

Generic Graph Construction.
J. Symb. Log., 1984

1980
Chains and Antichains in P(omega).
J. Symb. Log., 1980

1977
On Splitting Stationary Subsets of Large Cardinals.
J. Symb. Log., 1977

1976
Adding a Closed Unbounded Set.
J. Symb. Log., 1976

On a theorem of silver.
Discret. Math., 1976

1975
Canonical Partition Relations.
J. Symb. Log., 1975

Partitioning Vector Spaces.
J. Comb. Theory A, 1975

1974
The Hanf Number for Complete L <sub>omega1, omega</sub> -Sentences (Without GCH).
J. Symb. Log., 1974

A Short Proof of Hindman's Theorem.
J. Comb. Theory A, 1974

Improvement of a Partition Theorem of Erdös and Rado.
J. Comb. Theory A, 1974


  Loading...