Logic and Computation (PHIL2650)


This unit covers central results about the nature of logic, the nature of computation, and the relationships between the two. Topics treated include basic set theory, Turing machines, the theory of computability and uncomputability, the decision problem for first order logic, Tarski's theorem on the indefinability of truth, and Gödel's famous incompleteness theorem.

Our courses that offer this unit of study

Further unit of study information


1x2-hr lecture/week, 1x1-hr tutorial/week


2x1000wd assignments (problem sets) (2x25%) and 1x2hr exam (50%)

Faculty/department permission required?


Unit of study rules

Prerequisites and assumed knowledge

PHIL1012 or PHIL2628 or permission of instructor

Study this unit outside a degree

Non-award/non-degree study

If you wish to undertake one or more units of study (subjects) for your own interest but not towards a degree, you may enrol in single units as a non-award student.

Cross-institutional study

If you are from another Australian tertiary institution you may be permitted to underake cross-institutional study in one or more units of study at the University of Sydney.