October 14
Chris Conidis, CUNY
The computability of Artin-Rees and Krull Intersection

We will explore the computational content of two related algebraic theorems, namely the Artin-Rees Lemma and Krull Intersection Theorem. In particular we will show that, while the strengths of these theorems coincide for individual rings, they become distinct in the uniform context.

Video

‚Äč