X-Authentication-Warning: darwin.helios.nd.edu: dsolomon owned process doing -bs
Date: Thu, 19 Dec 2002 14:11:57 -0500 (EST)
From: David Reed Solomon <dsolomon@nd.edu>
X-Sender: dsolomon@darwin.helios.nd.edu
Reply-To: Solomon.7@nd.edu
To: Carole Martin <martin.73@nd.edu>
Subject: Re: Exams

Hi Carole,

I did not give any exams in Math 661 nor did I have an official syllabus.
The outline of the topics covered in the course is:

1)  Boolean algebras, complete extensions of consistent theories, and
Stone Duality.  Equivalence of Pi^0_1 classes with spaces of ultrafilters
and sets of complete consistent extensions.  

2)  Many examples of Pi^0_1 classes (including classes of separating sets
and thin classes).  Applications to Boolean algebras and theories.

3)  Measure and category of subsets of 2^{\omega} defined in computability
theory.

4)  Sigma^0_1 classes and 1-randomness.

5)  Connections between 1-random degrees, DNR sets, DNR_k sets, FPF
degrees, and PA degrees.  

6)  Introduction to priority arguments on trees, including construction of
a minimal pair and the Sack's Splitting Theorem.

7)  Basic results on Medvedev and Muchnik degrees.

8)  Introduction to computable analysis: computable reals, computable
functions, continuity, and connections to constructivism.

If you need more detail about the topics I covered in the course, I am
happy to give more details.

Best,
Reed Solomon



On Tue, 17 Dec 2002, Carole Martin wrote:

> 'Tis that time of year again.
> 
> Please send me electronic copies of your course's syllabus, exams 1, 
> 2, 3, and the final exam.  These, as you know, are submitted to the 
> course archives (which is an invaluable file for reference if it's 
> kept up to date.)
> 
> I don't keep quizzes or homework assignments, so you can skip those.
> 
> Thanks.
> 
> It's been good working with you this year.  Have a wonderful holiday 
> and a happy new year all year long!
> 
> Carole
> -- 
>