MTH313 Mathematical Logic
Level: 3
Credit Units: 5 Credit Units
Presentation Pattern: EVERY JULY
Synopsis:
There are a number of remarkable limitations related to computation and finite arithmatic.MTH313
develops the necessary framework and tools to investigate and understand such limitations. In
particular, the limitations of finite mathematical structures such as Godels theorem are discused and
interpreted.
Topics:
ƔTuring machines.
ƔMonadic notation and standard position.
ƔAbacus machines.
ƔFlow charts and register tables.
ƔPrimitive recursive functions.
ƔRecursive functions.
ƔPrimitive recursive conditions.
ƔPrimitive recursive functions a and q.
ƔFormal number theory.
ƔTruth tables and formal proof.
ƔProofs in the axiom system Q.
ƔNone standard interpretations of Q.
Learning Outcome:
ƔTest Turing machines.
ƔDemonstrate Turing machine flow graph.
ƔDesign an Abacus machine flow chart.
ƔIllustrate primitive recursive functions.
ƔAnalyze Turing Machine Flow Graphs.
ƔCompute with truth tables.
ƔUse formal proofs in number theory.
ƔConstruct non-standard interpretations in the axiom system Q.
ƔConstruct and formulate a range of mathematical techniques to solve a variety of quantitative
problems.
ƔFormulate solutions to problems individually and/or as part of a group.
ƔAnalyze and solve a number of problem sets within strict deadlines.
Assessment Strategies:
Continuous Assessment Component
COMPUTER MARKED ASSIGNMENT
COMPUTER MARKED ASSIGNMENT
COMPUTER MARKED ASSIGNMENT
Sub-Total
Weightage (%)
10
10
10
30
Examinable Component
Weightage (%)
Page 1 of 2
Examinable Component
Written Exam
Sub-Total
Weightage Total
Weightage (%)
70
70
100
Page 2 of 2