Messages - Page 2

Dear All. The problem class will take place February 14 (Wednesday). We will start a quarter past four (16:15), and we will be in Seminarrom Postscript (our regular room).

You are entitled to vote for several alternatives. If you like, give you first, second (and third) priority. But if you vote for an alternative and that alternative wins, you are obliged to come to the problem class.

I have lectured the first few pages of Section 7.4.

We can have a problem class where we study the exercises at pp. 212-215.

You can vote for the following options:

1. Friday 9th 16:15
2. Monday 12th 16:15
3. Wednesday 14th 16:15.

Vote by sending an e-mail to larsk@math.uio.no

Vote before Thursday 8th 16:00. The result will be announced shortly after at this website.

The next lecture will take place February 6.

Page 212-214: exercise 1, 2, 3, 4, 5 and 6.

Exercise 8 and 9 are for those who need an extra challenge (they are hard).

I have now lectured  until the end of Section 7.3 (page 209). I will talk a little bit more on the stuff towards the end of the section: primitive recursive coding of sequences. Thereafter, I will start to lecture Section 7.4.

Those of you who are not familiar with our the book's  coding conventions should read Section 4.5.

The first lecture is over. I have lecture Section 7.1 and Section 7.2 until page 201. Next Tuesday I will lecture the last few pages of Section 7.2, and then I will start to Lecture Section 7.3.

Those of you who want to prepare yourself for the lecture, can read Section 7.3 (Primitive Recursion).

Curriculum: Chapter 7 of "A Friendly Introduction to Mathematical Logic" and parts of the book

                   O. Aberth: Computable Analysis.

"A Friendly Introduction to Mathematical Logic"  is available here:

https://minerva.geneseo.edu/a-friendly-introduction-to-mathematical-logic/

I will provide a pdf of Aberth's book (you do not need this book for a while).