D.8: Logic
From
(→Discrete Math Learning modules) |
(→Discrete Math Learning modules) |
||
Line 27: | Line 27: | ||
[[media:Curriculum_Tree.pptx | Logic overview (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> | [[media:Curriculum_Tree.pptx | Logic overview (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> | ||
[[media:Symbolic_Logic.pptx | Symbolic logic (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> | [[media:Symbolic_Logic.pptx | Symbolic logic (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> | ||
- | [[media:Introduction_to_predicates.pptx | Introduction to predicates (from Terrel Smith's class, MS-Powerpoint slide set)]] | + | [[media:Introduction_to_predicates.pptx | Introduction to predicates (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> |
- | [http://faculty.chemeketa.edu/mfry5/cs160/Labs/160-Lab02Q.doc Online CS Modules: Machine Architecture, Part 2 Problem set] | + | [http://faculty.chemeketa.edu/mfry5/cs160/Labs/160-Lab02Q.doc Online CS Modules: Machine Architecture, Part 2 Problem set]<br/> |
== Resources for Logic == | == Resources for Logic == |
Revision as of 22:27, 13 April 2011
Oregon Department of Education knowledge and skills for Logic
D.8 Logic: Understand the fundamentals of propositional logic, arguments, and methods of proof.
D.8.1 Use truth tables to determine truth values of compounded propositional statements.
D.8.2 Find the converse, inverse, and contrapositive of a statement.
D.8.3 Determine whether two propositions are logically equivalent.
D.8.4 Identify and give examples of undefined terms, definitions, axioms, and theorems.
D.8.5 Construct logical arguments using laws of detachment (modus ponens), syllogism, tautology, and contradiction; judge the validity of arguments, and give counterexamples to disprove statements.
D.8.6 Use applications of the universal and existential quantifiers to propositional statements.
D.8.7 Appropriately select and use methods of deductive, inductive, and indirect proof and determine whether a short proof is logically valid.
Discrete Math Learning modules
Logic overview (from Terrel Smith's class, MS-Powerpoint slide set)
Symbolic logic (from Terrel Smith's class, MS-Powerpoint slide set)
Introduction to predicates (from Terrel Smith's class, MS-Powerpoint slide set)
Online CS Modules: Machine Architecture, Part 2 Problem set
Resources for Logic
These are links to information about Logic:
Online CS Modules: Machine Architecture
Online CS Modules: Machine Architecture, Part 2
Online CS Modules: Machine Architecture, Part 3
Note that all of the above links have related Problem Sets in Microsoft WORD format that can be accessed through Mitch Fry's CS 160 site: [1]
Introduction to Logic (Old Dominion University)
Introduction to Logic, Online Exercises (Old Dominion University)