cse541

LOGIC for COMPUTER SCIENCE

Spring 2011

GENERAL NEWS:

Time:

Place:

Professor:

1428 CS Building; 632-8458
e-mail: anita at cs.sunysb.edu
Office Hours: Tuesday, Thursday, 1:30pm - 2:30 pm, and by appointment

Teaching Assistant>

Yanqing Chen

e-mail: cyqclark@hotmail.com
Office Hours: Monday, Tuesday
Office Location: CS Room 2110

Course Texbook

AN INTRODUCTION TO CLASSICAL and NON-CLASSICAL LOGICS
Anita Wasilewska

Full Book Text and Lecture Slides are in Downloads

Course Reading Book

Introduction to Mathematical Logic, Fourth Edition
Elliot Mendelson

General Course Description:

General Course Information

There will be TWO MIDTERMS and a FINAL examination. There also will be assigned sets of homework problems students must work out and learn for the tests. The complete solutions to all problems are posted on the course webpage. Students are also responsible to learn and work put all Examples and Exercises in the text book and some PROOFS of the main Theorems.

All tests are CLOSED NOTES and CLOSED BOOK. If a student is found using notes or a book during a test, he/she will receive AUTOMATICALLY 0pts for a given test.

There will be many exercieses-homeworks sets posted on the web. NONE will be collected or graded.
Students are responsible for working out and writing DETAILED solutions explaining all steps and methods used, as it is done in our book. We will cover some of such detailed solutions in class and post ALL of them on our web page for you to study and learn how to properly write them. Students are also responsible to learn and work out all Examples, Exercises and Homeworks in the text book as well as some PROOFS of the main Theorems.
Your GRADES on the tests will depend on the form, attention to details, and carefulness of your written solutions. The course will follow the book very closely and in particular we will cover some , or all of the following chapters and subjects.

Course Content

The course will follow the book very closely and in particular we will cover some, or all of the following chapters and subjects.

Chapter 1: Introduction: Mathematical Paradoxes and Computer Science Puzzles

Chapter 2: Introduction to Classical Propositional Logic

Chapter 3: Propositional Languages

Chapter 4: Classical Propositional Semantics

Chapter 5: Some Extentional Three and Many Valued Logics Semantics

Chapter 6: Classical tautologies, Logical Equivalences and Equivalences of Languages

Chapter 7: General Proof Systems

Chapter 8: Hilbert Proof Systems; Deduction Theorem

Chapter 9: Two Proofs of Propositional Classical Logic Completeness Theorem

Chapter 10: Introduction to Intuitionistic Logic; Conections between Classical and Intuitionistic Logics.

Chapter 11: Classical Automated Proof systems: RS and original Gentzen

Chapter 12: Gentzen Proof System for Intuitionistic Logic.

Chapter 13: Classical Predicate Logic: Hilbert Formalization

Chapter 14: Classical Predicate Logic: Automated Proof System QRS

Chapter 15: Hilbert and Gentzen Proof Systems for Intuitionistic Predicate Logic

Chapter 16: Introduction to Modal Logics, Modal S4 and S5 and their connections with Intuitionistic logic.

Mendelson Book: Goedel Incompleteness Theorem

DOWNLOADS

TESTS

PRACTICE FINAL

SOME BASIC DEFINITIONS and FACTS

Exercises - Homework Problems

Exercises - Homework SOLUTIONS

TESTS SCHEDULE

Practice Midterm 1: Tuesday, March 8, in class

Midterm 1: Thursday, March 11, in class

Midterm 2: Thursday, April 14, in class.

Spring Break: April 16 - April 24

FINAL: MAy 20, 2:15-4:45, our classroom

EXTRA Lecture Notes 1,2

Book Slides

Book Chapters

Academic Integrity Statement

Stony Brook University Syllabus Statement