Difference between revisions of "MAT1313"
Jump to navigation
Jump to search
(Create row template.) |
(Week 2 row) |
||
| Line 15: | Line 15: | ||
Propositional Logic | Propositional Logic | ||
|| | || | ||
| − | + | – | |
|| | || | ||
| + | * Ability to recognize propositional formulas built from atoms using connectives. | ||
| + | * Ability to correctly interpret propositional formulas using truth tables. | ||
|- <!-- START ROW --> | |- <!-- START ROW --> | ||
| <!-- Week# --> | | <!-- Week# --> | ||
| − | + | 2 | |
|| <!-- Sections --> | || <!-- Sections --> | ||
| − | + | 1.2 | |
|| <!-- Topics --> | || <!-- Topics --> | ||
| − | + | Tautologies and Deductions | |
|| <!-- Prereqs --> | || <!-- Prereqs --> | ||
| − | + | Propositional Logic | |
|| <!-- SLOs --> | || <!-- SLOs --> | ||
| − | + | * Establish whether a propositional formula is a tautology. | |
| + | * Recognize conditional tautologies as patters of deduction. | ||
| + | * Express conditionals in disjunctive form. | ||
| + | * Express the negation of a conditional in conjunctive form. | ||
| + | * Identify the direct and contrapositive forms of a conditional. | ||
| + | * Recognize the non-equivalence of a conditional and its converse. | ||
| + | * Recognize a biconditional as the conjunction of a conditional and its converse. | ||
|- | |- | ||
|} | |} | ||
Revision as of 15:17, 5 November 2021
Course Catalog
MAT 1313. Algebra and Number Systems. (3-0) 3 Credit Hours.
Corequisite: MAT1214. Basic logic and proofs. Properties of integer numbers, mathematical induction, the fundamental theorem of arithmetic, the infinitude of primes, modular arithmetic, rational and irrational numbers, complex numbers, functions, polynomials, and the binomial theorem. Generally offered: Fall, Spring. Course Fees: LRS1 $45; STSI $21.
Topics List
| Week # | Sections | Topics | Prerequisite Skills | Student Learning Outcomes |
|---|---|---|---|---|
| 1 |
1.1 & 1.2 |
Propositional Logic |
– |
|
|
2 |
1.2 |
Tautologies and Deductions |
Propositional Logic |
|
