Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Logic 2011

  News | Dates | Grading | Content | Exercises | Exam | Slides | Literature | Software

Oct 11

Please note the following change: The post-exam review is in 03.11.058 (seminar room inside the "finger" of the chair).

Oct 4

The preliminary results of the "second final exam" have been published in TUMonline. The post-exam review (Klausureinsicht) is going to be on Thursday, Oct 13, in 03.09.014 03.11.058 from 14:00 to 14:30+.

Also: The exam [PDF],
and a proposal for the solution: [PDF]

Sep 19

The place and time for the "second final exam" have been (finally) fixed:

The exam is going to take place on the 26th of September in CH21010 (chemistry building) from 17:00 to 19:00. (Right now, TUMonline is still saying 17:00-18:30, but this should be fixed soon.)
Please be at the lecture hall already at 16:45 so that we may start at 17:00 sharp.

Aug 5

The exam: [PDF]
A proposal for the solution: [PDF]

Aug 4

The preliminary results of the exam have been published in TUMonline. The post-exam review (Klausureinsicht) is going to be on the next Monday (08.08.2011) in 09.03.014 from 10:00 to 10:30+.

Aug 1

Fixed some small errors in the solution to the mock-exam.

July 28

Some typos in the last set of slides have been corrected. Please notice that the exam can contain basic questions about mathematical theories and/or Gödel's theorems.

July 21

There is a new set of slides about Gödel's theorems.

July 18

The solution and tutorial notes for sheet #9 have been uploaded. Exercise 9.3 can only be found in the notes. Exercise 9.3a) got corrected in the notes to give a correct equivalence for max(x,y) * c (without introducing new existential quantifiers :)).

As a reminder: Next time, there will be a mock exam with a length of approx. 45-60 minutes.

July 12

  • The exam will last for two hours and will be ''closed book'', i.e., only bring along your wrtiting utensils (no red/green/pencil, pretty please) and your student ID. We will supply you with paper.
  • As announced in the lecture there are two dates for taking the exam this semester:
    • 02.08.2011 in MW 1801 from 17:00 to 19:00.
      We kindly ask you to arrive at the lecture hall till 16:45 so that the exam can start at 17:00 sharp.
    • 26.09.2011, details tba.

June 30

Slide 6 of the set "Resolution for predicate logic" contained several mistakes. They have been corrected.

June 8

In slide 16 of the undecidability set, in the first line of the definition of psi_0 the OR is wrong, replace by AND.

June 7

The slides about Formalizing Statements have been improved a bit to address the questions raised yesterday in the lecture. I'll comment briefly on this tomorrow. JE

June 6

Fourth exercise sheet is there. Happy solving! :)

June 1

Some slides have been added to the set ``Predicate logic''.

May 31

The solutions for the exercises two and three have been uploaded. This includes the limboole script for checking the unsatisfiability of the pigeon hole formula as mentioned in the tutorial.

May 26

Because of the holiday next week (2nd of May), there will be a lecture on the 6th, while the tutorial will take place on the 9th. Overview on the next few weeks:
  • M 30.5. Tu
  • W 1.6. Le
  • T 2.6. - (Christi Himmelfahrt)
  • M 6.6. Le
  • W 8.6. Le
  • T 9.6. Tu
  • M 13.6. - (Pfingstmontag)
  • W 15.6. Le
  • T 16.6. Le
  • M 20.6. Tu
  • W 22.6. Le
  • T 23.6. - (Fronleichnam)

May 20

The second homework has been uploaded.

May 19

The link to the set of slides "Compactness theorem [PDF-4]" was broken and has been repaired.

May 13

The solutions for the first homework have been uploaded. You will also find there the limboole scripts and the presented python program.

May 10

Thank you to Sree Harsha Totakura for identifying a small mistake in the algorithm for checking satisfiability of Horn formulas. The slides have been corrected.

The problem was that, contrary to what I announced in the lecture, the single-linked list and the bitvector of Slide 10 are not completely "synchronized". The list must contain the set of atomic formulas that have been marked but not yet processed, while the bit vector must contain the atomic formulas that have been marked, whether they have been processed or not.

Next Monday I will explain this in some more detail.

May 5

Here is the definitive schedule for the next lectures (it will be announced in today's lecture too):

No lecture on Friday, May 6.

Lecture on Monday, May 9, at 14:00, in MW 1250.

Tutorial on Wednesday, May 11, at 10:15, in HS 2

Tutorial on Thursday, May 12, at 12:15, in 00.13.009A

Lecture on Monday, May 16, at 14:00, in MW 1250.

No lecture on Wednesday, May 18

Lecture on Thursday, May 19, at 12:15, in 00.13.009A

May 4

There are some unexpected good news. We have been able to find a suitable lecture hall in the building for mechanical engineering (Maschinenbau), which is free Mondays at 14:00. So we won't have to reschedule the exercises. Details will be announced tomorrow during the lecture.

May 2

The links to some sets of slides (under Slides) were broken and have been repaired.

April 28

In the week 9.5--13.5 lectures and tutorial will be swapped: on Monday, May 9 there will be a lecture instead of a tutorial, and on Wednesday and Thursday, May 11 and 12, there will be tutorials instead of lectures. The rooms do not change.

April 14

The slides for the course can be found under the corresponding menu point. The points Content and Software have also been updated.

April 12

The time slots for the lecture have been corrected. Sorry for the mistake. They can also be found in TUM-online.

April 1

Creation of this site.