Logic 1

326.019, 326.021 - Mathematical Logic 1

Winter Semester 2009

The course is an introduction to logic for students in Computer Science and Mathematics.

The contents of the lecture is very similar to the transcript by Martin Koehler of previous lectures: pdf file. (May contain some typos and small errors.)

For more details (some of which are not covered in the lecture) I recommend: Bruno Buchberger: Logic for Computer Science pdf file. This material is copyrighted and is available only for the students of this lecture and only for the purpose of study related to it.

Purpose

Understand the principles of Mathematical Logic and its mathematical models, aquire the skills for using it in Mathematics and Computer Science.

Contents

The principles of Mathematical Logic and its role in human activity.

Main models: propositional logic, first-order predicate logic, higher-order logic. Proof systems: correctness, completeness.

Practical use of Mathematical Logic in Mathematics (building theories, proving), and in Computer Science (automatic reasoning, programming, describing and proving properties of programs).

Organization

The lecture takes place on Thursdays:

8:30 to 12:45 in HS6.

If the lecture does not take place in a certain week, this will be announced on this page.

• The exercises will not be scheduled separately, but will be interspersed within the lecture at the appropriate places.
The home page of the lecture in WS 2008 may give you an idea about the contents and the homeworks, although the current lecture will not be exactly the same.

Lectures

• Oct. 8: Lecture 1:
• Examples relating Logic to Mathematics and Computer Science:
• simple law text;
• sorting by pattern matching;
• termination of programs.
• The role of Mathematics and Logic in science:
• intelectual problem solving: observe - solve - apply;
• applications of logic: verification of systems, semantic web.
• Demo of the Theorema system: Theorema-Demo-Oct-2009.zip.

• Oct. 15: Lecture 2:
• Propositional Logic:
• Syntax.
• Semantics.
• Semantic equivalence, logical consequence.
• Proof methods: truth table.
• Homework 1: logic-hw-1.pdf, logic-hw-1.tex.

• Oct. 22: Lecture 3:
• Propositional Logic:
• Semantical based notions and properties.
• Proof method by rewriting.
• Resolution: correctness, completeness.
• Homework 2: logic-hw-2.pdf, logic-hw-2.tex.

• Oct. 29: Lecture 4:
• Propositional Logic: sequent calculus.
• No homework.

• Nov 5: Lecture 5:

• Nov. 12: Lecture 6:
• Unique-goal sequent calculus: reveiw of the rules and their difference from the old rules, axioms, corectness, completeness.
• Resolution: the inference rule and the method.
• The DPLL algorithm for propositional SAT.
• Homework 4: logic-hw-4.pdf, logic-hw-4.tex.

• Nov. 19: Lecture 7:

• Nov. 26: Lecture 8:

• Dec. 3: Lecture 9:

• Dec. 10: Lecture 10:
• Predicate Logic:
• proving by resolution
• the Herbrand theorem
• No homework

• Dec. 17: No lecture

• Jan. 14: Lecture 11:
• Herbrand theorem.
• Completeness of resolution.
• Sequent calculus in first order predicate logic.
• Homework 7: logic-hw-7.pdf, logic-hw-7.tex.

• Jan. 21: Lecture 12 (last lecture):
• Double witness example.
• Proof in elementary analysis.
• Review of the material for the examination.
• Aspects concerning the relation between logic and programming.

• Jan. 28: Examination
• Theory: 08:30 - 10:00
• Exercises: 10:15 - 11:45

### Homeworks:

Each exercise counts in your final examination.

In case you send your homeworks by e-mail, please use my address tjebelea@risc.uni-linz.ac.at.

Also please use as name of the file[s] your name and the number of the homework, e. g. like Mayer-3.pdf or Schreiner-J-4.ps. Please do not use Windows Word files (*.doc) because the special symbols are not shown correctly on different systems. If you do not have alternative to Word, then please print the file using the option "Print to file" and send this file too.

T. Jebelean