CISC 102 Lecture Notes - Lecture 33: Complex Instruction Set Computing, Logical Connective, Truth Table

94 views3 pages
Verified Note

Document Summary

Typically, statements in mathematics are in the form: if p then q . In all examples below, assume variables are natural numbers. If a b and b a then a = b. If a - 7 < 0, then a < 7. If 2 | a then 2 | (a)(b) Note: all these statements are true, so long as a and b are natural #s. In logic, symbol > is used to model this type of statement, although the symbol does not necessarily have a causal relationship between p and q. If p then q is denoted as p > q, and is pronounced if p then q or p implies q . A truth table is used to define the outcomes when using the > logical operator. p. This is how implication is defined in logic, although the definition may not appear to make much sense. If sugar is sweet then lemons are sour.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions