Propositional Logic and Predicate Logic, Axioms and Completeness, Distinction Between Semantics and Syntax, Normal Forms, Herbrand Universe, Compactness and Applications Such As Non-standard Models, Definability Theory, Preservation Theorems. Applications To Arithmetic and Computability (incompleteness), Relational Data Bases, Abstract Data Types, Program Verification.

Faculty: Computer Science
|Undergraduate Studies |Graduate Studies
Pre-required courses

(234292 - Logic For Cs and 236343 - Theory of Computation) or (234293 - Logic and Set Theory For Cs and 236343 - Theory of Computation)

Semestrial Information

Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours

Go to Course Page

Go to Course Page


Responsible(s)

Michael Kaminski


Exams
Session A: 18-07-2022 13:00 - 16:00
  • טאוב 4.
Session B: 19-10-2022 13:00 - 16:00
  • טאוב 4.

Registration Groups
11
Lecture Tuesday 10:30 - 12:30 | Michael Kaminski
Exercise Tuesday 12:30 - 13:30 | Michael Kaminski
Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours

Go to Course Page

Go to Course Page


Responsible(s)

Michael Kaminski

Notes
  • ההרצאה והתרגיל יתקיימו בטאוב 701.

Exams
Session A: 23-07-2020 09:00 - 12:00
  • טאוב 4.
Session B: 22-09-2020
No Registration Groups
Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours

Go to Course Page

Go to Course Page


Notes
  • נפתח עי מדור מעקב
No Registration Groups