Difference between revisions of "MAT1313"
Jump to navigation
Jump to search
(Week 2 row) |
(Week 3: Quantifiers and Sets) |
||
Line 30: | Line 30: | ||
|| <!-- SLOs --> | || <!-- SLOs --> | ||
* Establish whether a propositional formula is a tautology. | * Establish whether a propositional formula is a tautology. | ||
− | * Recognize conditional tautologies as | + | * State De Morgan's Laws of logic. |
+ | * Recognize conditional tautologies as patterns of deduction. | ||
* Express conditionals in disjunctive form. | * Express conditionals in disjunctive form. | ||
* Express the negation of a conditional in conjunctive form. | * Express the negation of a conditional in conjunctive form. | ||
Line 36: | Line 37: | ||
* Recognize the non-equivalence of a conditional and its converse. | * Recognize the non-equivalence of a conditional and its converse. | ||
* Recognize a biconditional as the conjunction of a conditional and its converse. | * Recognize a biconditional as the conjunction of a conditional and its converse. | ||
+ | |- <!-- START ROW --> | ||
+ | | <!-- Week# --> | ||
+ | 3 | ||
+ | || <!-- Sections --> | ||
+ | 1.3, 1.4 & 1.5 | ||
+ | || <!-- Topics --> | ||
+ | * Quantifiers | ||
+ | * Sets | ||
+ | * Set Operations | ||
+ | * Introduction to proofs. | ||
+ | || <!-- Prereqs --> | ||
+ | * Propositional Logic | ||
+ | * Tautologies and Deductions | ||
+ | || <!-- SLOs --> | ||
+ | * Identify the domain of interpretation of a quantified statement. | ||
+ | * Interpret quantified statements. | ||
+ | * Negate quantified statements. | ||
+ | * Recognize and interpret set equality and set inclusion. | ||
+ | * Recognize set operations and state their formal definitions. | ||
+ | * Recognize a formal proof as a process of logical deduction of conclusions from assumptions. | ||
+ | * Prove basic results about set inclusion and set operations. | ||
|- | |- | ||
|} | |} |
Revision as of 16:12, 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 |
|
3 |
1.3, 1.4 & 1.5 |
|
|
|