Lectures
Announcements
Week 1
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 1.2 (pp. 10-25)
- Section 3.1 (pp. 110-111)
Week 2
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 2.1 (pp. 60-63)
- Section 2.3 (pp. 89-93)
- Section 2.2 (pp. 77-78 only Composition)
- Section 3.3 (pp. 146-150)
- Section 2.4 (pp. 98-103)
Week 3
Tuples and Lists (in Romanian)
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 1.3 (Subsection Tuples pp.30-32)
- Section 1.3 (Subsections Products of Sets pp. 32-34)
- Section 1.3 (Subsection Counting Tuples pp.52-53 only tuples counting)
- Section 2.2 (Composition and Tupling - Tuples of functions pp. 78-80)
- Section 1.3 (Subsection Lists pp. 34-35)
- Section 3.1 (Subsection Lists pp.113-117)
- Section 3.3 (Subsection Lists pp.151-156)
Week 4
Relations & Graphs (in Romanian)
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 1.3 (Subsection Relations pp. 38-41)
- Section 4.1 (Subsections Properties & Composition pp.174-176)
- Section 1.3 (Subsections Graphs & Paths in Graphs & Graph Traversals pp. 41-48)
Week 5
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 1.3 (Subsections Trees pp. 48-51)
- Section 3.1 (Subsection Binary Trees pp.120-121)
- Section 3.3 (Subsection BinaryTrees - Search Tree Example is optional, Traversing Binary Trees pp.159-162)
Week 6
Strings, Languages and Grammars (in Romanian)
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 1.3 (Strings Subsection pp. 36-37)
- Section 3.1 (Strings Subsection pp. 117-118)
- Section 3.3 (Strings Subsection pp. 157-158)
- Section 3.2 (Language Construction pp. 126-128 without Combining Languages)
- Section 3.2 (Subsection Grammar and Derivation pp. 130-143 without pages 138-140)
Week 7
Propositional Logic (in Romanian)
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 6.2 Propositional Calculus (Subsections Intro, Well-Formed Formulas, Syntax, Semantics, Equivalence pp. 309-316)
- Section 6.2 (Subsections Disjunctive Normal Form, Conjunctive Normal Form, Constructing CNF/DNF Using Equivalences pp. 320-326)
- Section 6.3 (Formal Reasoning Systems, pp. 329-334)
- Section 6.3 (Subsections Indirect Proof, pp. 338-339)
- Section 9.2 (Subsection A Primer of Resolution for Propositions pp. 461-462)
Week 8
Suggested Reading
- J. Hein - Discrete Structure, Logic and Computability (1st Edition)
- Section 7.1 First Order Predicate Calculus (Intro, Well-Formed Formulas, Semantics, Validity - Only the first part) pp. 351 - pp. 362
- Section 7.2 Equivalencies (Normal Forms, English Sentences) pp. 374 - pp. 379
- Section 9.2
- Subsection Clauses and Clausal Form pp. 455 - pp. 460
- Subsection Substitution and Unification pp. 462 - 467 - The algorithm and Composition of Substitutions Sub-subsections are Optional)
- Subsection Resolution: The General Case pp. 467 - pp. 470
- Subsection Theorem Proving with Resolution pp. 473 - pp. 474
Week 9
Logica Predicatelor -- exemple (in Romanian)
Suggested Reading
- Alte exemple si exercitii de rezolutie in logica predicatelor se pot gasi aici