SLIDE 1
1
snick snack
CPSC 121: Models of Computation 2016W2
Propositional Logic: A First Model of Computation Steve Wolfman, based on notes by Patrice Belleville and others
1
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
Introductions, again
Steven Wolfman <wolf@cs.ubc.ca> ICICS 239; office hours listed on the website I also have an open door policy: If my door is open, come in and talk! Also, I will usually be available after class. And, you can make appointments with me Additionally, you can use TA office hours
2
Outline
- Prereqs, Learning Goals, and Quiz Notes
- True, False, and Gates. Why Start Here?
- Problems and Discussion
- Next Lecture Notes: Unit Continues...
3
Learning Goals: Pre-Class
By the start of class, you should be able to:
– Translate back and forth between simple natural language statements and propositional logic. – Evaluate the truth of propositional logic statements using truth tables. – Translate back and forth between propositional logic statements and circuits that assess the truth of those statements.
4
How should you achieve pre-class goals? Use the quiz to guide your readings!
Learning Goals: In-Class
By the end of this unit, you should be able to:
– Build combinational computational systems using propositional logic expressions and equivalent digital logic circuits that solve real problems, e.g., our 7- or 4-segment LED displays (using a “DNF” or any other successful approach).
7
Where We Are in The Big Stories
Theory How do we model computational systems? Now: learning the underpinning of all our models (formal logical reasoning with Boolean values). Hardware How do we build devices to compute? Now: establishing
- ur baseline tool
(gates), briefly justifying these as baselines, and designing complex functions from gates.
11