Characterizing weak compactness. - Lee J. Stanley (Ann. Pure Appl. Log., 1984)

A theorem and some consistency results in partition calculus. - Saharon Shelah; Lee J. Stanley (Ann. Pure Appl. Log., 1987)

A Borel Reducibility Theory for Classes of Countable Structures. - Harvey Friedman; Lee J. Stanley (J. Symb. Log., 1989)

A Combinatorial Forcing for Coding the Universe by a Real When There Are No Sharps. - Saharon Shelah; Lee J. Stanley (J. Symb. Log., 1995)

The Combinatorics of Combinatorial Coding by a Real. - Saharon Shelah; Lee J. Stanley (J. Symb. Log., 1995)

Filters, Cohen Sets and Consistent Extensions of The Erdös-Dushnik-Miller Theorem. - Saharon Shelah; Lee J. Stanley (J. Symb. Log., 2000)

Forcing Many Positive Polarized Partition Relations Between A Cardinal and Its Powerset. - Saharon Shelah; Lee J. Stanley (J. Symb. Log., 2001)

A Busy Beaver Problem for Infinite-Time Turing Machines. - James T. Long; Lee J. Stanley (CoRR, 2014)