cse541
LOGIC for COMPUTER SCIENCE
Spring 2026


Course Information

News:

Tests Schedule  UPDATED.

We have  3 Extra Credit Quizes  (5 points each)
EQ1 Thursaday, February 12
EQ1  covers   Lecture 3 Translations Problems
and   Predicate Language Translation (Lecture 2a, 2b)
 for languages with different sets of propositional connectives,
similar to problems we did in class on Thursday, february 5.
 
Professor office hours UPDATED: Wednesday, 1:00 pm - 3:00 pm


Time:  Wednesday  6:30pm  - 7:50pm

Place:  Mellville Library E4320

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:   Wednesday 1:00pm - 3:00pm
In person: 208  New CS Building
and by appointment
  

Teaching Assistants  Office Hours

 TAs Office Hours are  posted and updated on BRIGHTSPACE

TAs Office Location 
In person: 2126  Old CS Building
 

Course Textbook

Anita Wasilewska
LOGICS FOR COMPUTER SCIENCE:  Classical and Non-Classical
Springer 2019

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 has an option of providing you with chapters of your choice

Here is  a copy of the MY BOOK for you to use. Please read the  relevant chapters before and after the LECTURES.
Study  Examples and Problems solutions - you need to  know them  all for your TESTS.

COURSE TEXTBOOK COPY

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: January 26 - 31
Class Lectures:
Lecture 0,1   - in class
 Lecture 2, 2a - in class
Chapter 1 VIDEO
: Introduction: Paradoxes and Puzzles
Chapter 2 VIDEO
: Introduction to Classical Logic

WEEK 2: February 1 - 7   
Class Lectures:
Lecture 2a, Lecture 2b,
Chapter 2 VIDEO: Introduction to Classical Logic

WEEK 3: February 8 - 14   
Class Lectures:  Lecture 3, 3a
 Chapter 3 VIDEO: : Propositional Semantics: Classical and Many Valued

WEEK 4:  February 15 -21
Class Lecture
Chapter 3 VIDEO: : Propositional Semantics: Classical and Many Valued
 
-  material included in Class Lectures 3c, 3d

WEEK 5:  February 22 -28 
Chapter 3 VIDEO: Propositional Semantics: Classical and Many Valued
- material included in Class Lectures 3e

WEEK 6: March 1 - 7
Chapter 4 VIDEO: General Proof Systems
- material included in Class Lectures 4, 4a

WEEK 7: March 8 - 14  
Chapter 5 VIDEO: Hilbert Proof Systems for Classical Propositional Logic
- material included in Class Lecture 5

WEEK 8: March 15 -  21    Spring Break March 16 -20
Chapter 5 VIDEO: Hilbert Proof Systems for Classical Propositional Logic
 - material included in Class Lecture 5a

WEEK 9: March 22 - 28

Chapter 5 VIDEO: : Hilbert Proof Systems for Classical Propositional Logic
 
- material included in Class Lecture 5b

WEEK 10:  March 29 - April 4
Chapter 6 VIDEO Automated Proof Systems for Classical Propositional Logic
-  Class Lectures 6, 6a

WEEK 11:  April 5 -11
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:  April 12 -18
Chapter 10 VIDEO:  Predicate Automated Proof Systems - QRS Proof System
 - Class Lecture 10

WEEK 13:  April 19 - 25 
Chapter 10 VIDEO:  Predicate Automated Proof Systems
 - Skolemization and Resolution Clauses
- Class Lecture 10

WEEK 14:   April 26 - May 2
Chapter 11 VIDEO:  Hilbert Program, Godel Incompleteness Theorems
 - Class Lecture 11 Part 1: Formal Theories

WEEK 15:   May 3 - 9
Chapter 11 VIDEO:  Hilbert Program, Godel Incompleteness Theorems
- Class Lecture 11 

Grading General Principles and Workload

TESTING

ALL TESTS, including the FINAL Examination will be given IN CLASS

The PRELIMINARY schedule is poste
d below. Changes will be posted on the course Webpage and  on BRIGHT SPACE

We do not give  MAKE-UP TESTS  except of documented cases of illness or documented emergencies

Contact TAs if you need more information or need to talk about grading

 
WORKLOAD
there will be 2 QUIZZES(40pts Total), MIDTERM (80pts), and  FINAL (80pts).
 I will also give THREE, one page  EQ - Extra Credit Quizzes for  (15 extra points total).
EQ Quizzes schedule to be announced.
The consistency of your efforts and work is the most important for this course.

None of the grades will be curved

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

TESTS PRELIMINARY Schedule

EQ1 -  Thursday, February 12 - extra credit Q1
EQ2 - Tuesday, February  24- extra credit Q2
Q1
- Thursday, March 5 - regular Q1
Spring Break   -  March 16 - 20
MIDTERM 
Thursday, March 26
EQ3 -
Tuesday, April 14- extra credit Q2
Q2 - Thursday, April 23   - regular Q1
FINAL 
May 14 - 8:30pm - 11:00pm


DOWNLOADS

Spring 2026 SYLLABUS

CLASS LECTURES 

  Lecture 0:   COURSE SYLLABUS, COURSE  GOALS and TASKS

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 STATEMENT

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