Spring 2020

THE COURSE FINAL GRADES ARE NEVER POSTED on BLACKBOAD

THE COURSE FINAL GRADES ARE POSTED ONLY ON

THIS IS THE UNIVERTSITY RULE

Students can estimate their grades following the SYLLABUS and UPDATED SYLLABUS

THE RULES OF ASSIGNING the Letter Grades are well defined in the SYLLABUS and have been publicized from the DAY one of the semester

COURSES SYLLABUSES are LEGAL DOCUMENTS

FINAL DATES CORRECTION

You can

You will have up to 3 attempts

MATERIAL for FINAL

STUDY all previous TEST and Quizzes

I will give

I will also include simple questions about

Make sure you review/read it

PRACTICE FINAL posted on
Blackboard MAY 5 and is due any
day before or on MAY 7 via Blackboard

Study GL SYSTEM Examples and Completeness Theorem, do not
need Hauptzatz Theorem

Lecture 6a: Gentzen Sequents System,
Hauptzatz Theorem

Study LI SYSTEM for Intuitionistic Logic Examples
and Proof Search Heuristic

Lecture 7a: Gentzen Systems for
Intuitionistic Logic

**SOME ** Chapters 4, 5, 6, 7 Exercises SOLUTIONS POSTED

**STUDY PLAN **for the rest of semester

WEEK **April 20 - 25 **

**Chapter 6** VIDEO: Proof Systems** RS, RS1, RS2**
- only material included in **Lecture 6 **

WEEK **April
27 - 30 **

**Chapter 6** VIDEO: Gentzen Proof Systems** GL, LK, LI**
- only material included in **Lecture 6a **

WEEK **May
4 - 8 **

**Chapter 7** VIDEO: Intiduction to **Intuitionistic
Logic** - only material included in **Lecture 7**

**Chapter 7** VIDEO: Gentzen System **LI for
Intuitionistic Logic** - only material included in **Lecture
7a
**

FINAL posted on Blackboard MAY 12 and is due any day before or on MAY 19 via Blackboard

I DID IT because I wanted to encourage you and HELP you to study new MATERIAL in hard times

BUT YOU HAVE TO write your OWN solutions and to do it in such way as to make it VISIBLE to US (and yourself) that you really worked and you UNDERSTAND material you supposed to study

will result in

**Q2 **
- **poste
**on Blackboard APRIL 15
and **is due** **THURSDAY,
APRIL 16**** **via Blackboard**
Q2 **WILL HAVE 2-3 QUESTIONS AND ONE EXTRA CREDIT
QUESTION

You are free to use te book, lectures, and all other material provided

Q

Lecture 4: General Proof Systems

Lecture 4a: Review Definitions and Problems

Lecture 5: Hilbert Proof Systems for Classical Logic, Deduction Theorem

** VIDEO
LECTURES **slides **POSTED**

NEW **UPDATED SYLLABUS**** **POSTED

NEW **UPDATED TESTS
SCHEDULE **** **POSTED

All test now are TAKE HOME TESTS

Midterm SOLUTIONS posted

Office: NCS Building; Room 208

Phone: 632-8458

e-mail: anita@cs.stonybrook.edu

e-mail only

New Computer Science Building room 208 phone: 2-8458

Office Hours: e-mail only

Office Location: 2217 Old CS Buildingng

Office Hours: e-mail only

Office Location: 2217 Old CS Building

ALL GRADES are listed on BLACKBOARD

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

We have very good TAs - please e-mail them anytime when you need help

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

The course outcomes and catalog description are in the official course description page.

There is no recitations, but I will cover some solutions to the course book homeworks assignments and held questions/answers sessions in class. Students are also responsible to study chapters examples that are not included in Lectures. I may include them in Quizes and Tests.

there will be 2 QUIZZES (25 points each), MIDTERM (75pts), and FINAL (75 pts) examination

The consistency of your efforts and work is the most important for this course

There will be some extra credit problems as a part of quizzes and tests I will also give a PRACTICE FINAL for 20 extra point

The % grade is translated into a letter grade in a standard way - see SYLLABUS for explanation

**FINAL - ****posted**
on Blackboard MAY
17 and** is due any day before or
on** MAY19

Practice Final SOLUTIONS

Q2 SOLUTIONS

MIDTERM SOLUTIONS

Q1 SOLUTIONS

**Book Chapter 1: Introduction: Paradoxes and Puzzles **

Lecture 1: Logic Motivation:
Paradoxes and Puzzles

Lecture 1a: Review: Some Definitions
and Facts

** 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 Semantics

Lecture 3c : Many Valued Semantic:
Lukasiewicz, Heyting, Kleene, Bohvars

Lecture 3d: Review (1) Definitions
and Problems

Lecture 3e: Tautologies, Equivalence
of Languages, Review (2)

** 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 6a: 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: Predicate Languages and
Predicate Semantics 1

Lecture 8a: Predicate Languages and
Predicate Semantics 2

Lecture 8b: Predicate Languages and
Predicate Semantics 3

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

** Book Chapter 10: Predicate Automated Proof Systems**

Lecture 10: Predicate Languages,
QRS-Automated Proof System for Classical Predicate Logic

Lecture 10a: Proof of Completeness
Theorem for QRS

** Book Chapter 11: Classical Formal Theories:
Consistency and Completeness **

Lecture 11: Formal Theories and
Godel Theorems - an Introduction

CHAPTER 2

CHAPTER 3

CHAPTER 4

CHAPTER 5

CHAPTER 6

CHAPTER 7

CHAPTER 9

CHAPTER 10

CHAPTER 11

Exercise 2 Solutions

Exercise 3 Solutions

Exercise 4 Solutions

Exercise 5 Solutions

Exercise 6 Solutions

Exercise 7 Solutions

Exercise 8 Solutions

Exercise 10 Solutions

Exercise 11 Solutions

PRACTICE 1 MIDTERM

Q1 SOLUTIONS

Q2 SOLUTIONS

Q2 Solutions

Q3 Solutions

MIDTERM Solutions

Q4 Solutions

Q5 Solutions

Q6 Solutions

Q7 Solutions

Q2 Solutions

Q3 Solutions

Q4 Solutions

MIDTERM Solutions

Q5 Solutions

Q6 Solutions

Review

Order Relations, Lattices, Boolean Algebras

Cardinalities of Sets

Midterm Challenge Problem