FINAL - Tuesday, May 7, 2:15 pm –
5pm classroom
FINAL has two parts: Problems
and Theory
All Final Problems are very similar to ONE PROBLEM
Quizzes Q1-Q6, Midterm, and Practice Final
Concentrate on reviewing Lectures Material covered in them.
There will be 2 short Questions for LOGIC part (Q1, Q2, Q3), and
one Question for
DMB (Q4, Midterm), CTB(Q5, Q6), CM (Practice Final,
CMLecture 2).
For the Theory part there will be two Questions:
(1)Pumping Lemma Proof that the Language L= an bn.
is not Regular (CTBLecture 4) and
(2)Proof of correctness of EUCLID Algorithm
(CMLecture3).
I will review these proofs, and other important Parts of Course
you need for FINAL
in detail during in the last week of classesTue and Th.
New improved version of CMLectures 2, 3
are POSTED
FINAL will have 10 extra credid points
PRACTICE FINAL,
Thursday, April 25 in class,
at 1:00pm
It is a 2 Problems Test (15 extra points) covering
material
from CM Lectures 1, 2
CM Lecture 3 problem will be on FINAL
CM Lecture 3 posted
Q6
Solutions posted
NEW CONCRETE MATHEMATICS
CM Lectures 1,2 Posted
NEW TCB Lecture 6 Posted
NEW TCB Lecture 5 Posted
NEW UPDATED TCB Lecture
4 Posted
Q5 SOLUTIONS Posted
TCB Lecture 4 POSTED
MIDTERM SOLUTIONS
POSTED
FINAL: May 7,
2:15 pm - 5:00pm, in our Classroom Melville
Library W4550
MIDTERM Thursday March 21
STUDY Q1-Q4 SOLUTIONS, Problems and THEOREMS
and FACTS from P2 DM Lectures 1-3
Review carefully Definitions and Facts from P2
DM DEFINITIONS 1 and 3.
I put them all together for you from material we
covered in class- you will have to recognize them
in Yes/No QUESTIONS included
in Midterm and Problems in the Test.
The same applies to Q4 Yes/No
Questions and have provided detailed Solutions
Some may appear as very similar problems on the MIDTERM
THIS is what you have to know for P2 DM part
of the MIDTERM
STUDY P1 LOGIC Chapters 2, 3 and 5 REVIEWS,
Study examples of natural language
TRANSLATIONS to different Propositional
Languages (Chapter 3)
and Predicate Languages (Chapter
2, 3) based on them - Translation
Problem will be on MIDTERM
Write CAREFULLY Justification
to the Predicate Logic Self Test-
all answers are to be found
in Lectures, book, etc - you must provide mathematical counter models
for all Quantifiers Formulas
that are not Tautologies or
Logical Equivalences
You must know Basic Classical
Tautologies and Logical
Equivalences - Propositional and Predicate and be
able
to deduce others from the, Must know basic like Definability of Connectives Equivalences
and apply them to
Equivalences of Propositional Languages
We covered enough Examples and Problems SOLUTIONS in CLASS for
you to to study as examples but
of course there is plenty more Exercises and Logic
Problems with SOLUTIONS written for you in
the
BOOK if you want to practice more
PREDICATE LOGIC Yes/No
SELF TEST Posted
P1 LOGIC Chapter 3 Review for MIDTERM Posted
P2 DM Lectures 1 - 4
Posted
Discrete Mathematics DEFINITIONS
posted
Q4 SOLUTIONS Posted
Q3 SOLUTIONS Posted
Q3 covers Lectures 4,5 Short
Versions, and DMB Lecture 1 material covered
on Tuesday, February 27
On Tuesday, February 20, we
cover a short VERSIONS of
Lecture 4: General Proof Systems,
Lecture 5: Hilbert Proof Systems for Classical Logic, and
Lecture 6: - on THURSDAY, February 22
as an END of LOGIC Lectures
We START BASICS of Discrete Math - as NEXT
WEEK - read DMB Lecture 1 for
TUESDAY, February 27
I will comment on the BASIC
Definitions and questions to appear on Q3
Q2 SOLUTIONS POSTED
Q1 SOLUTIONS are posted
WE
HAVE our own LOGIC,
Theory of Computation LECTURES
YOUTUBE CHANEL
LOGIC,
Theory of Computation
208 New CS Building
phone: (631) 632-8458
e-mail: anita@cs.stonybrook.edu
Professor Anita Wasilewska Office Hours
Short questions via email any timeTAs Office Hours are posted and updated on BRIGHTSPACE an mailed to all students
Book B1
We will cover
Chapter 2 (Introduction to Classical
Propositional and Predicate Logic,
present an OVERVIEW of parts of
Chapter 3 (Formal syntax and propositional
extensional semantics)
and of parts of Chapters 4,5, 6
(Proof Systems, Completeness Theorems, and
Automated Theorem Proving)
Here is my manuscript of the Book B1 for you to use
My Logic BookWe will cover
all Chapter 1.
This is Discrete Mathematics
Basics segment of the course. We
may supplement it by
special Discrete
Mathematics Lectures.
We present an
OVERVIEW of parts of Chapters 2, 3,
4 - in particular of Regular and Context Free
Languages,
Finite Automata, and Turing Machines.
We will cover content of Chapter 1 (Recurrent and Closed Form Formulas, Repertoire Method), some of Chapter 2 (Sums and Recurrences, Finite and Infinite Calculus, Infinite Sums), and some of Chapter 4 (Number Theory).
The course presents FUNDAMENTALS of Computer
Science Theoretical Foundations
divided into Three PARTS: P1
- LOGIC, P2
- Discrete Mathematics, Theory of Computation, P3 - Concrete
Mathematics
Book B1 Chapter 2: Introduction to Classical Logic
Lecture 2: Propositional Language and
Semantics
Lecture 2a: Predicate Language and
Semantics
Lecture 2b: Chapter 2 Review
Book B1 Chapter 3: Propositional Semantics: Classical and
Many Valued
Lecture 3: Formal Propositional Languages
Lecture 3a: Classical Propositional
Semantics
Lecture 3b : Many Valued Semantic:
Lukasiewicz, Heyting, Kleene, Bohvars
Lecture 3c: Extensional Semantic M
Lecture 3d :Classical Tautologies and
Equivalence of Languages
Lecture 3e: Chapter3: REVIEW for MIDTERM
Book B1 Chapter 4: General Proof Systems: Syntax and
Semantics - OVERVIEV
Lecture 4: General Proof Systems
Lecture 4a: Chapter 4 Review
Book B1 Chapter 5: Hilbert Proof Systems for Classical
Propositional Logic - OVERVIEW
-
Lecture 5: Hilbert Proof Systems for
Classical Logic
Book B1 Chapter 6: Automated Proof Systems for Classical
Propositional Logic OVERVIEW
Book B1
Chapter 7: Introduction to Intuitionistic and Modal
Logics - reading
Lecture 7; Introduction to
Intuitionistic Logic
Lecture 7a: Introduction to Modal Logics
Book B1 Chapter 11: Classical Formal Theories:
Consistency and Completeness -
reading
Lecture 11: Hilbert Program, Godel
Incompleteness Theorems
Book B2 Chapter 1:
Sets, Relations, and Languages
All Chaper 1
Book B2 Chapter 1
and DISCRETE MATHEMATICS BASICS
DMB - Lecture
1
DMB - Lecture 2
DMB - Lecture 3
DMB - Lecture 4
DM DEFINITIONS 1
DM DEFINITIONS 2
DM DEFINITIONS 3
Book B2 Chapters 2, 3 THEORY of COMPUTATION BASIC
TCB - Lecture 1: Closures and Algorithms Book B3 Chapters 1,4
CONCRETE MATHEMATICS BASICS
CM Lecture 1: Recurrent Problems -
Tower of Hanoi, Josephus Problem
CM Lecture 2: Generalized Josephus