Research > Task VII: Decidability issues and links to complexity theory
Task VII: Decidability issues and links to complexity theory
Description
Problems of decidability or complexity arising in model theory are quite varied, and of significance to logicians, number theorists and computer scientists.
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. Progress Years 1 and 2, Years 3 and 4. |
Last updated: March 23 2021 09:23 | Please send your corrections to: |