Loading presentation...

Present Remotely

Send the link below via email or IM

Copy

Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.

DeleteCancel

Make your likes visible on Facebook?

Connect your Facebook account to Prezi and let your likes appear on your timeline.
You can change this under Settings & Account at any time.

No, thanks

A Polychromatic Ramsey Theory for Ordinals

Classical Ramsey theory looks for monochromatic cliques of a certain size, whereas our theory considers polychromatic cliques. We investigate a purely set theoretic question as well as versions for computable and automatic structures.
by

Martin Huschenbett

on 25 February 2013

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of A Polychromatic Ramsey Theory for Ordinals

A Polychromatic Ramsey Theory
for Ordinals Martin Huschenbett Classical Ramsey Theory Computable
Structures Automatic
Structures Set Theory Polychromatic Ramsey Theory Computable
Structures Automatic
Structures Set Theory Questions Computable
Structures Automatic
Structures Set Theory Motivation Bipartite Ramsey Pigeon Hole Principle Ramsey's Theorem Erdős & Rado 1956 Sierpiński 1933 Ramsey 1930 Ramsey 1930 Specker 1971 Jockusch 1972 Jockusch 1972 Rubin 2008 Trivial Galvin (unpublished) Erdős & Rado 1956 polychromatic Definition Theorem (H&L 2012) Definition Theorem (H&L 2012) Theorem (H&L 2012) Theorem (H&L 2012) Definition Cantor normal form Upper Bounds Are Sharp Observation Observation Cantor normal form Observation polychromatic Technische Universität Ilmenau AUT, Auckland, NZ Jiamou Liu joint work with LogInf 2012 (Mannheim)
AlMoTh 2013 (Berlin) Infinite Pigeon Hole Principle Pigeon Hole Principle for Ordinals
Full transcript