Skip to content

Logic For Computer Science

Public syllabus for 2025-2026

Academic overview

Programme
AI
Period
Year 1, Semester 1
Credits
5
Weeks
14

Curriculum placement

Appears in study plans

Teaching team

Course coordinator
(none)
Seminar coordinators
(none)

Learning time distribution

Total
Curriculum Lecture Practice Total Weekly Lecture Practice
56 28 28 4 2 2
Exam hours
6
Individual Study Bibliography study Field study Homework Tutoring Others
69 27 0 28 8 0
Overall
125

Learning outcomes

Knowledge

  • C1.Fundamental computer science and math knowledge. / Cunoștințe fundamentale de informatică și matematică.

Skills

  • A1. The ability to identify appropriate formal/computational models, to use scientific modeling/computational instruments, to analyze the efficiency of an instrument or to use data structures/
  • Abilitatea de a identifica modele formale/computaționale adecvate, de a utiliza instrumente de
  • modelare și de calcul științific, de a analiza eficiența unui algoritm sau a utilizării unei structuri de
  • date.
  • A3. The ability to identify appropriate algorithms/data structures for solving concrete problems, to apply the development principles to applications and to implement algorithms in a programming language. /Abilitatea de a identifica algoritmi și structuri de date adecvate unei probleme concrete, de a
  • aplica principiile de dezvoltare a unei aplicații informatice și de a implementa algoritmi într-un
  • limbaj de programare.

Responsibility

  • R1. The capacity to solve automatically specific tasks, in an autonomous manner/ Capacitatea de a rezolva în manieră autonomă sarcini specifice.
  • R2. The capacity to identify/select appropriate solutions and to generate novel ideas. / Capacitatea de a identifica/selecta soluții/căi de rezolvare adecvate și de a genera idei
  • inovative.
  • R3. The capacity to identify and plan correctly the specific tasks for a particular project. / Capacitatea de a identifica și planifica corect/eficient sarcinile specifice unui anumit proiect.
  • R6. The capacity to adapt to new requirements and ways to carry out activities. / Capacitatea de a se adapta la noi cerințe și modalități de desfășurare a activității.

Online platform

(none)

Course content

Content Methods Obs
L01. Motivation: logic, mathematics, computer science. What is mathematics? Reasoning. Properties of reasoning. What is (mathematical) logic? Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L02. Logic and language. Models in logic. Logic motivated by mathematics. Logic motivated by computer science. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L03. Propositional logic. Informal description. Syntax, strict form, relaxed form. Parsing propositions Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L04. Semantics of propositional logic. Truth values. Interpretations. Truth value under interpretation. Validity. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L05 Satisfiability. Truth tables. Propositional equivalence. A catalogue of equivalent formulae. Logical consequence. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L06. Deduction theorem. Applications: digital circuit design. Boolean functions. Complete sets of boolean connectives. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L07. Normal forms. Literals. Negation normal form. Transformation procedure. Conjunctive normal form. Disjunctive normal form. Transformations to normal form. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L08. Resolution. Clausal form. Correctness of a resolution step. Resolution algorithm. Correctness and completeness. Improvements: Davis Putnam (DP). Davis Putnam Logemann Loveland (DPLL). Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L09. The relevance of predicate logic. Syntax. Substitutions. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L10. Semantics of predicate logic. Validity, satisfiability. Logical equivalence. Logical consequence. Logic equivalent formulas. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L11. Reasoning in predicate logic. Axioms. Inference rules. Proofs. Proof techniques. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L12. Definitions. Theories. Proving using equalities. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L13. Proving by induction. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)
L14. Case studies. Summary review. Q&A/Lecture/Dialogue Lecture materials available on Google Classroom (details pending)

Course bibliography

Adrian Crăciun – Logic for Computer Science. Lecture Notes. 2024 (Posted on Google Classroom) Mordechai Ben-Ari, Mathematical Logic for Computer Science. Second Revised Edition. Springer, 2001. Bruno Buchberger, Logic for Computer Science. Manuscript, Copyright Bruno Buchberger 1991. Folosit cu permisiunea autorului. Jean H. Gallier, Logic for Computer Science, Foundations of Automatic Theorem Proving, Copyright 2003, Jean H. Gallier. John Harrison, Handbook of Practical Logic and Automated Reasoning, Cambridge University. Daniel J. Velleman, How to Prove It: A Structured Approach, Second Edition, Cambridge University Press, 2006.

Seminar content

Content Methods Obs
S01-S03. Motivating examples, review of basic notions. Summary of lecture materials. Presentation (by students). Dialogue. Homeworks announced on Google Classroom (details pending)
S04-S14: Weekly homeworks – solutions. Corresponding to the content of the lecture. Summary of lecture materials. Presentation (by students). Dialogue. Homeworks announced on Google Classroom (details pending)
Bibliography: Adrian Crăciun – Logic for Computer Science. Lecture Notes. 2024 (posted on the Google Classroom).

Seminar bibliography

Reasoning-based problem solving knowledge and skills are essential in any activity based on computer science, and this is particularly true for the IT industry.

Corroboration

(none)

AI tools guidance

(none)

Evaluation and delivery

Activity Criteria Methods Percentage
C
  • 10: excellent (outstanding performance with only minor errors),
  • 8-9: very good (above the average standard but with some errors),
  • 6-7: satisfactory (fair, but with significant shortcomings),
  • 5: sufficient (performance meets minimum criteria),
  • 0-4: fail (significant work has to be done)
  • Written exam
  • 70.0%
S
  • Regular homework.
  • Optional work available: implementations of methods discussed.
  • Continuous evaluation.
  • 40.0%
  • 20.0%

Performance standards

Basic knowledge of the concepts presented in the lecture: explain and apply. Minimal knowledge is measured by reaching the grade for passing the exam (5).

Additional info

(none)