Skip to content

Finite canonization

Saharon Shelah

math.COarXiv:math/9509229

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 in [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 subseteq 1, ...,n the equality holds iff (for all l in v)(il = jl). In this paper we improve the bound on ER(n,m) so that fixing n the number of exponentiation needed to calculate ER(n,m) is best possible.

Create a lesson