Show/hide contentOpenClose All
Curricular information is subject to change
On successful completion of this module, the student is expected to be able to understand the definitions, theorems and examples covered in all of the topics listed above. These include, but are not limited to, reviewing injections, surjections and bijections; demonstrating that there is no 'largest infinite set'; Russell's Paradox; the axioms of Set Theory; the Axiom of Infinity and the Principle of Mathematical Induction; constructing and ordering the natural numbers; finite, infinite and uncountable sets; building the arithmetic of natural numbers; partially ordered sets and the Schroeder-Bernstein Theorem via Tarski's Fixed Point Theorem; the Axiom of Choice and Zorn's Lemma; `good' and `bad' consequences of Choice; building a more complete theory of equinumerosity and dominance; and (time allowing) metamathematics and undecidability in Set Theory (e.g the Continuum Hypothesis) and Computer Science (Turing's Halting Function).
Student Effort Type | Hours |
---|---|
Lectures | 30 |
Tutorial | 10 |
Specified Learning Activities | 24 |
Autonomous Student Learning | 46 |
Total | 110 |
Mathematical Analysis (MATH10320), Linear Algebra 2 for Math. Sci. (MATH20300) and Groups, Rings and Fields (MATH20310) are desirable.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Continuous Assessment: Two 50-minute written closed-book in-class tests (worth 10% each). | Unspecified | n/a | Standard conversion grade scale 40% | No | 20 |
Examination: Written closed-book examination. | 2 hour End of Trimester Exam | Yes | Standard conversion grade scale 40% | No | 80 |
Resit In | Terminal Exam |
---|---|
Spring | Yes - 2 Hour |
• Group/class feedback, post-assessment
Not yet recorded.