Lee J. Stanley

According to our database1, Lee J. Stanley authored at least 8 papers between 1984 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
A Busy Beaver Problem for Infinite-Time Turing Machines.
CoRR, 2014

2001
Forcing Many Positive Polarized Partition Relations Between A Cardinal and Its Powerset.
J. Symb. Log., 2001

2000
Filters, Cohen Sets and Consistent Extensions of The Erdös-Dushnik-Miller Theorem.
J. Symb. Log., 2000

1995
The Combinatorics of Combinatorial Coding by a Real.
J. Symb. Log., 1995

A Combinatorial Forcing for Coding the Universe by a Real When There Are No Sharps.
J. Symb. Log., 1995

1989
A Borel Reducibility Theory for Classes of Countable Structures.
J. Symb. Log., 1989

1987
A theorem and some consistency results in partition calculus.
Ann. Pure Appl. Log., 1987

1984
Characterizing weak compactness.
Ann. Pure Appl. Log., 1984


  Loading...