Justin Palumbo
email: justinpa at math dot ucla dot edu
office: MS6617F
I am a graduate student at UCLA studying set theory. My advisor is Itay Neeman.
Logic Center Summer School Links. (includes course notes)
Papers.
Unbounded and dominating reals in Hechler extensions
(with Joel David Hamkins) The rigid relation principle
Not set theory:
F. Blanchet-Sadri, Raphaël Jungers and Justin Palumbo, Testing avoidability on sets of partial words is hard.
Theoretical Computer Science, Vol. 410, 2009, pp 968-972.
F. Blanchet-Sadri, N.C. Brownstein, A. Kalcic, Justin Palumbo and T. Weyand, Unavoidable sets of partial words.
Theory of Computing Systems, Vol. 45, No. 2, 2009, 381-406.
F. Blanchet-Sadri, N.C. Brownstein and Justin Palumbo, Two element unavoidable sets of partial words.
in T. Harju, J. Karhumäki, and A. Lepistö (Eds), DLT 2007, 11th International Conference on Developments in Language Theory, July 3-6, 2007, Turku, Finland, Lectures Notes in Computer Science, Vol. 4588, Springer-Verlag, Berlin, Heidelberg, 2007, pp 96-107.