Completed
Formally defining formulas
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Great Ideas in Theoretical Computer Science: Deductive Systems
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Hilbert's 10th problem
- 3 An example involving parentheses
- 4 Example binary tree deduction
- 5 Binary tree terminology
- 6 The ATM deductive system
- 7 Parenthesis deductive system
- 8 One final question
- 9 Propositional Logic Refresher
- 10 Formally defining formulas
- 11 Truth assignment V: setting of Tor F for each variable.
- 12 In the binary tree perspective
- 13 Satisfiability
- 14 All well-formed formulas
- 15 Logical Equivalence
- 16 Example equivalences
- 17 Problem: Show (((x+y)^x) +y) is a tautology.
