Kathryn Vozoris : The Morley rank modulo a predicate of the complex field with a predicate for the integers

Posted by Matthias Aschenbrenner , part of the Logic Seminar.

At

Oct. 24, 2006, 4 p.m.

In

SEO 427

Abstract

I will discuss the notion of Morley rank modulo a predicate (PMR) recently introduced by Jacob Heidenreich. This is a generalization of Morley rank designed for structures with a predicate, where the underlying structure without the predicate is totally transcendental. The aim of PMR is to measure the dimension of a structure without taking into account the definable sets generated by the predicate. I will discuss the proof that the PMR of the complex field with a predicate for the integers is larger than every natural number.