Finite canonization

Saharon Shelah*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

The canonization theorem says that for given m, n for some m* (the first one is called ER(n;m)) we have for every function f with domain [1,.., m*]n, for some A ∈ [1,.., m*]m, the question of when the equality f(i1,.., in) = f(j1,.., jn) (where i1 < · · · < in and j1 < · · · jn are from A) holds has the simplest answer: for some v ⊆ (1,.., n) the equality holds iffWe improve the bound on ER(n, m) so that fixing n the number of exponentiation needed to calculate ER(n, m) is best possible.

Original languageEnglish
Pages (from-to)445-456
Number of pages12
JournalCommentationes Mathematicae Universitatis Carolinae
Volume37
Issue number3
StatePublished - 1996

Bibliographical note

Publisher Copyright:
© 1996, Charles University, Faculty of Mathematics and Physics.

Keywords

  • Canonization
  • Erdös-Rado theorem
  • Ramsey theory

Fingerprint

Dive into the research topics of 'Finite canonization'. Together they form a unique fingerprint.

Cite this