Research > Task VII: Decidability issues and links to complexity theory
Task VII: Decidability issues and links to complexity theory
Problems of decidability or complexity arising in model theory are quite varied, and of significance to logicians, number theorists and computer scientists.
VII.1: Finitely generated fields and connections with arithmetic (Hilbert s 10th problem)
a) Investigate existential definition.
of the integers in the rationals, or in rings of algebraic integers.
a) Examine the P=NP problem in important rings.
a) Prove that the residue fields in models of IƊ0 + Ω1 are pseudofinite.
Years 1 and 2, Years 3 and 4.
|Last updated: September 9 2009 15:54||Please send your corrections to:|