Fall 2018

**LAST CLASS ** Monday,
December 10

**Q2**** ** SOLUTIONS POSTED

**FINAL - ****December
17, 5:30 pm- 8pm,** IN
the CLASSROOM

**FINAL** covers Problems
from Q1, Q2, Midterm, Extra
Midterm, and Makup
Midterm

I posted Extra and Makeup Midterms for you to
study

**THERE IS NO PRACTICE FINAL**

But here is an **extra credit **SHORT TEST on PREDICATE LOGIC

BRING IT to class on MONDAY or to class on the day of the FINAL

or e-mail it to TA

Q2 covers
Decomposition Trees Definition,

Strong Soundness and Constructive Completeness proofs for
RS type systems and Gentzen G System,

Classical and Intuitionistic Gentzen (will give you the
rules) proof search examples

I will give give
you **EXTRA MIDTERM** on
**Monday, November 19 ****
** Final Midterm score will be the average of the scores of the
two tests

EXTRA MIDTERM is voluntary

You can keep your Midterm score you already have if you wish

CHAPTER 7 Lectures POSTED

Midterm Solutions Posted

Office: NCS Building; Room 208

Phone: 632-8458

e-mail: anita@cs.stonybrook.edu

Monday, Wednesday 12:40 pm - 2:00 pm, Wesnesday 7:10pm - 8pm, and by appointment

New Computer Science Building room 208 phone: 2-8458

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

We will list names who is correcting which part of the test when you take them

We have very good TAs - please e-mail them, go to see them anytime you need help

Office Hours: Tuesday, Thursady, 10:00 am - 11:00 am

Office Location: 2217 Old CS Building

Office Hours: Monday 10am -12:00 am

Office Location: 2217 Old CS Building

Office Hours: Tuesday, Thursday, 6:00 pm - 7:00 pm

Office Location: 2217 Old CS Building

Office Hours: Monday, 7:30 am - 8:30am and 7:30 pm - 8:30 pm

Office Location: 2217 Old CS Building

LOGICS FOR COMPUTER
SCIENCE: Classical and Non-Classical

Anita Wasilewska

The book is under
contract with SPRINGER to be published in Spring 2019

Lectures follow the Textbook chapter by chapter- so read the chapters.

Chapters EXTEND the Lecture Notes and contain hundreds of Examples, Exercises with solutions and Homework problems

Wadsworth&Brooks/Cole Advanced Books &Software, PACIFIC GROVE, CA

C.C. Leary, A Friendly Introduction to Mathematical Logic

Printice Hall, 2000

You can also read any other Logic book you find in the
Library

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

there will be 2 quizzes (25 points each), Midterrm, and FINAL (75 points each )& 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 extra credit

It is a preliminary Schedule- the NEW SCHEDULE, if needed will be published in the NEWS section

Q1 - Wednesday, October 3

FALL BREAK - October 8 - 9

THANKSGIVING BREAK - November 21 - 25

Q2 - Wednesday, December 5

PRACTICE FINAL (extra credit): Monday, December 10

FINAL - December 17, 5:30 pm- 8pm

Q1 SOLUTIONS

Q2 SOLUTIONS

Midterm Makup

Extra Midterm

Syllabus

Course and Book Goals and Tasks

Lecture 1: Paradoxes and Puzzles

Lecture 1a: Review: Some Definitions and Facts

Book Chapter 2: Introduction to Classical Logic

Lecture 2a: Propositional Language and Semantics

Lecture 2b: Predicate Language and Semantics

Book Chapter 3: Propositional Semantics: Classical and Many Valued

Lecture 3: Formal Propositional Languages

Lecture 3a: Classical Propositional Semantics (NEW)

Lecture 3b : Extensional Semantics (NEW)

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

Lecture 3d: Review (1) Definitions and Problems

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

Chapter 2 Review (NEW)

Book Chapter 4: General Proof Systems: Syntax and Semantics

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

PRACTICE MIDTERM 2

MIDTERM 1 SOLUTIONS

PRACTICE MIDTERM 1

Q1 SOLUTIONS

Q2 SOLUTIONS

Q2 Solutions

Q3 Solutions

MIDTERM 1 Solutions

Q4 Solutions

Q5 Solutions

Q6 Solutions

Q7 Solutions

Q2 Solutions

Q3 Solutions

Q4 Solutions

MIDTERM 1 Solutions

Q5 Solutions

Q6 Solutions

Review