Great Ideas in Theoretical Computer Science: Deductive Systems

Great Ideas in Theoretical Computer Science: Deductive Systems

Ryan O'Donnell via YouTube Direct link

Satisfiability

13 of 17

13 of 17

Satisfiability

Class Central Classrooms beta

YouTube videos 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. 1 Intro
  2. 2 Hilbert's 10th problem
  3. 3 An example involving parentheses
  4. 4 Example binary tree deduction
  5. 5 Binary tree terminology
  6. 6 The ATM deductive system
  7. 7 Parenthesis deductive system
  8. 8 One final question
  9. 9 Propositional Logic Refresher
  10. 10 Formally defining formulas
  11. 11 Truth assignment V: setting of Tor F for each variable.
  12. 12 In the binary tree perspective
  13. 13 Satisfiability
  14. 14 All well-formed formulas
  15. 15 Logical Equivalence
  16. 16 Example equivalences
  17. 17 Problem: Show (((x+y)^x) +y) is a tautology.

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.