cse541
LOGIC for COMPUTER SCIENCE
Fall 2022



Course Information

News:


Practice Final Solutions posted
Q2 Solutions  posted
MIDTERM SOLUTIONS
posted

Examples of SOLUTIONS of  past MIDTERMS  POSTED

Q1 SOLUTIONS POSTED



Time:  Tuesday, Thursday  6:30pm  -7:50pm

Place:  FREY HALL 100

WE  HAVE  our own  LOGIC LECTURES  YOUTUBE CHANEL

  LOGIC,  Theory of Computation 

The first 4 Lectures are Theory of Computation,  LOGIC LECTURES follow
Please use them for study  study during the semester

Professor:

Anita Wasilewska

208  New CS Building
phone:  (631) 632-8458

e-mail: anita@cs.stonybrook.edu

Professor Anita Wasilewska

Office Hours

Short questions via email any time
e-mail: anita@cs.stonybrook.edu
Office Hours:   Tuesday, Thursday  1:30pm - 2:30pm
In person: 208  New CS Building   

Teaching Assistants 

Office Hours Posted and updated on Blackboard

TESTING

ALL QUIZZES and TESTS, including the FINAL Examination will be given in CLASS

ALL GRADES are listed on BLACKBOARD
Contact TAs if you need more information or need to talk about grading

Course Textbook

Anita Wasilewska

LOGICS FOR COMPUTER SCIENCE:  Classical and Non-Classical

Springer 2018

ISBN 978-3-319-92590-5             ISBN 978-3-319-92591-2 (e-book)

You can get the book in Hard cover, or in Electronic form
Springer also has an option of providing you with chapters of your choice

Here is my manuscript of the BOOK for you to use

My Logic Book

Course Goal

The goal of the course is to make student understand the need of, and to learn the formality of logic. The book, and the course is developed to teach not only intuitive understanding of different logics, but (and mainly) to teach formal logic as scientific subject, with its language, definitions and problems

Course Structure

I will progress relatively slowly, making sure that the pace is appropriate for the students in class. The book is written with students on my mind so that they can read and learn by themselves, even before coming to class. For sure, it is also essential to study after the class.
  Students are also responsible to study chapters examples  and problems that are not included in Lectures. I may include them in Quizzes and Tests.

  Preliminary STUDY PLAN  

WEEK 1: August 22 - 28
Class Lecures:
Lecture 0 - in class, Lecture 1  -  reading and Video,
 Lecture 2 - in class
Chapter 1 VIDEO
: Introduction: Paradoxes and Puzzles
Chapter 2 VIDEO
: Introduction to Classical Logic

WEEK 2: August 29 - September 4
Class Lectures:
Lecture 2a, Lecture 2b
Chapter 2 VIDEO: Introduction to Classical Logic

WEEK 3: September 5 - September 11
Chapter 3 VIDEO: : Propositional Semantics: Classical and Many Valued- material included in Class Lectures 3, 3a, 3b

WEEK 4: September 12 - September 18
Chapter 3 VIDEO: : Propositional Semantics: Classical and Many Valued- material included in Class Lectures 3c, 3d

WEEK 5: September 19 - September 25
Chapter 3 VIDEO: : Propositional Semantics: Classical and Many Valued- material included in Class Lectures 3e

WEEK 6: September 26 - October 2  Q1 Tuesday, September 27
Chapter 4 VIDEO: : General Proof Systems - material included in Class Lectures 4, 4a

WEEK 7: October 3 - October 9
Chapter 5 VIDEO: : Hilbert Proof Systems for Classical Propositional Logic - material included in Class Lecture 5

WEEK 8: October 10 - October 16   Fall Break October 10-11
Chapter 5 VIDEO: : Hilbert Proof Systems for Classical Propositional Logic - material included in Class Lecture 5a

WEEK 9: October 17 - October 23   MIDTERM October 20
Chapter 5 VIDEO: : Hilbert Proof Systems for Classical Propositional Logic - material included in Class Lecture 5b

WEEK 10: October 24 - October 30 
Chapter 6 VIDEO: : Automated Proof Systems for Classical Propositional Logic -  Class Lectures 6, 6a

WEEK 11:   Octiber 31- November 6
Chapter 6 VIDEO: : Automated Proof Systems for Classical Propositional Logic -  Class Lectures 6a, 6b
Chapter 7 VIDEO:  Introduction to Intuitionistic and Modal Logics - Class Lecture 7b

WEEK 12:   November 7- November 13
Chapter 10 VIDEO:  Predicate Automated Proof Systems - QRS Proof System - Class Lecture 10

WEEK 13:   November 14 - November 20  Q2 Thursday,  November 17
Chapter 10 VIDEO:  Predicate Automated Proof Systems - Skolemization and Resolution Clauses - Class Lecture 10

WEEK 14:   November 15 - November 21  Thanksgiving Break November 23 -27
Chapter 11 VIDEO:  Hilbert Program, Godel Incompleteness Theorems - Class Lecture 11 Part 1: Formal Theories

WEEK 15:   November 28 - December 4    Practice Final posted November 29  due December 1
Chapter 11 VIDEO:  Hilbert Program, Godel Incompleteness Theorems - Class Lecture 11 

Grading General Principles and Workload

Workload and  GRADING
There will be 2 Quizzes,  Midterm,   Practice Final (for extra credit),  and  Final examination

None of the grades will be curved

WE DO NOT GIVE  MAKE-UP TESTS

Quizzes: 50pts
2 quizzes, 25 points each

Midterm:  75pts
Midterm  will covers material from Q1 and  material covered after Q1 in class before Midterm

Practice Final: 15 extra pts

Final:  75pts

Final grade computation

You can earn up to 200 points + x extra points = 200+x points during the semester
The grade will be determined in the following way: number of earned points divided by 2 = % grade
The % grade is translated into a letter grade in a standard way - see SYLLABUS for explanation

Quizzes and Tests PRELIMINARY Schedule:

Q1 -  Tuesday, September 27
Fall Break  - October 10-11
MIDTERM -  Thursday, October 20  
Q2 - Thursday, November 17  
Thanksgiving Break - November 23 - 27  
Practice Final - posted November 29   due December 1  
 Final  -  December 8, 5:30pm -8:00pm in Classrrom


DOWNLOADS

PRACTICE FINAL SOLUTIONS
Q2 SOLUTIONS
MIDTERM SOLUTIONS
Q1 SOLUTIONS

SYLLABUS


Past MIDTERM SOLUTIONS- Example 1

Past MIDTERM SOLUTIONS - Example 2

Past MIDTERM SOLUTIONS - Example 3

Quantifiers Laws Test - Example 4

CLASS Lectures Slides

COURSE GENERAL STRUCTURE and GOALS

Book Chapter 1: Introduction: Paradoxes and Puzzles

Lecture 1:  Logic Motivation: Paradoxes and Puzzles

Book Chapter 2: Introduction to Classical Logic

Lecture 2: Propositional Language and Semantics
Lecture 2a: Predicate Language and Semantics
Lecture 2b: Chapter 2 Review

Book Chapter 3: Propositional Semantics: Classical and Many Valued

Lecture 3: Formal Propositional Languages
Lecture 3a: Classical Propositional Semantics 
Lecture 3b : Extensional Semantic
Lecture 3c : Many Valued Semantic: Lukasiewicz, Heyting, Kleene, Bohvar
Lecture 3d: Tautologies, Equivalence of Languages
Lecture 3e:Chapter 3 Review

Book Chapter 4: General Proof Systems: Syntax and Semantics

Lecture 4: General Proof Systems
Lecture 4a: Review Definitions and Problems

Book Chapter 5: Hilbert Proof Systems: Completeness of Classical Propositional Logic

Lecture 5: Hilbert Proof Systems for Classical Logic, Deduction Theorem
Lecture 5a: Completeness Theorem Proof 1
Lecture 5b: Completeness Theorem Proof 2

Book Chapter 6: Automated Proof Systems for Classical Propositional Logic 

Lecture 6: RS Systems
Lecture 6a: Gentzen Sequents SystemStrong Soundness and Constructive Completeness
Lecture 6b: Original Gentzen Sequents System, Hauptzatz Theorem

Book Chapter 7: Introduction to Intuitioniostic and Modal Logics

Lecture 7; Introduction to Intuitionistic Logic
Lecture 7a: Gentzen Systems for Intuitionistic Logic
Lecture 7b: Introduction to Modal Logics S4 and S5

Book Chapter 8: Classical Predicate Languages, Semantics, and Proof Systems

Lecture 8: Formal Predicate Languages
Lecture 8a:Classical Semantic
Lecture 8b: Predicate Tautologies

Book Chapter 9: Completeness and Deduction Theorem for Classical Predicate Logic

Lecture 9:Reduction Predicate Logic to Propositional
Lecture 9a: Henkin Method
Lecture 9b: Proof of Completeness Theorem
Lecture 9c:Deduction Theorem, Other Axiomatizations

Book Chapter 10: Predicate Automated Proof Systems

Lecture 10: QRS-Automated Proof System for Classical Predicate Logic
Lecture 10a: Skolemization and Resolution Clauses

Book Chapter 11: Formal Theories and Godel Theorems

Lecture 11: Hilbert Program, Godel Incompleteness Theorems

VIDEO LECTURES  Slides

CHAPTER 1
CHAPTER 1 
CHAPTER 2  
CHAPTER 3
CHAPTER 4
CHAPTER 5
CHAPTER 6
CHAPTER 7
CHAPTER 8
CHAPTER 9
CHAPTER 10
CHAPTER 11

ACADEMIC INTEGRITY STATEAMENT

Each student must pursue his or her academic goals honestly and be personally accountable for all submitted work. Representing another person's work as your own is always wrong. Any suspected instance of academic dishonesty will be reported to the Academic Judiciary. For more comprehensive information on academic integrity, including categories of academic dishonesty, please refer to the academic judiciary website