This unit of study unifies and extends mathematical ideas and techniques that most participants will have met in their first and second years, and will be of general interest to all students of pure and applied mathematics. It combines algebra and logic to present and answer a number of related questions of fundamental importance in the development of mathematics, from ancient to modern times. The Propositional and Predicate Calculi are studied as model axiomatic systems in their own right, including proofs of consistency and completeness. The final part of the course introduces precise notions of computability and decidability, through abstract Turing machines, culminating in the unsolvability of the Halting Problem the undecidability of First Order Logic, and a discussion of Godel's Incompleteness Theorem. Classical and novel arithmetics are introduced, unified and described abstractly using field and ring axioms and the language of field extensions. Quotient rings are introduced, which are used to construct different finite and infinite fields. A construction of the real numbers, by factoring out rings of Cauchy sequences of rationals by the ideal of null sequences, is presented. Axiomatics are placed in the context of reasoning within first order logic and set theory.
3x1-hr lectures; 1x1-hr tutorial/wk
Quiz (10%); 2 x assignments (30%); cognitive, problem-based final exam (60%)
6 credit points of Intermediate MathematicsProhibitions
MATH3062 or MATH3065