Mathematics 5162: Mathematical Logic
Fall 1998
- Lecturer :
Wayne Richter
- Office :
235 Vincent Hall
- Phone : 625-1858
- E-mail : richter@math.umn.edu
- Web Page: http://www.math.umn.edu/~richter
- Office hours: Monday and Wednesday 1:30-2:15,
and by appointment. If you want to make an appointment
for some other time, see me in class
or leave me a phone message (or send e-mail the day before).
You may also ask questions by
e-mail or through the
interactive internet
discussion
at any time.
Required Texts
- Course notes by Wayne Richter
- Turing's World 3.0. An introduction to
Computability Theory, by Jon Barwise & John Etchemendy.
These materials are available in
Williamson Bookstore .
Turing's World includes a floppy disk, formatted for the Macintosh,
containing software
for designing and viewing Turing machines. If you do not have access to a Macintosh,
there is a beta version which runs on Windows 95, Windows 98, and Windows NT. If you
need this beta version please see me.
Math 5162 is the first quarter of a year course, 5162-3-4, in
Mathematical Logic. Math 5162 is devoted to a study of algorithms and
computability. Math 5163 and Math 5164 develop first-order logic
through the Goedel
Completeness and Incompleteness Theorems. It is possible to
take Math 5163-4 without taking Math 5162, but it is not recommended
that one
take Math 5164 without first taking Math 5163.
Brief course description for Math 5162:
- informal notion of algorithm and computability
- Turing machines
- Church's Thesis
- primitive recursive functions
- partial recursive functions
- recursive sets
- recursively enumerable sets
- Kleene Normal Form
Grading (approximate):
- Homework 30%
- Hour Exams 20% each
- Final Exam 30%
Department of Mathematics .
-
Approximate class schedule, homework list, and late breaking news.
Updated Nov 25, 1998
-
Some old exams and related files.
Updated Nov 24, 1998.
-
Comments, questions and feedback.
-
Registrar's Web Site :
Visit this site to find class schedules, course guides, information
on
final exams, on-line registration, and much more.
-
Some of the course assignments require use of a computer.
For a list of computer labs and times of availability see:
University computer labs .
Last year it was not possible to use the Turing World software on computers
in those labs run by I.T. The software should run on at least some Macintosh
computers in the public labs.