21/02/2007, 14:30 — 15:30 — Room P3.10, Mathematics Building Luis Pereira, Université de Paris VII
How to see that a statement might be undecidable (II)
We will explain how to use mathematical logic in order to of classifying the complexity of a mathematical statement and at what level of complexity there are natural statements which are undecidable, for example, morphisms of uncountable algebras. Also, we will define basic objects of set theory and explain the reason why there are statements which are undecidable in a natural way and why undecidability is very different from ignorance.
