Units of study

PHIL2650 - Logic and Computation

Semester 1, 2012  |  Credit Points: 6

Coordinator: Nicholas Smith

Description

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.

Assessments

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

Classes

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

Prerequisites

PHIL1012 or PHIL2628 or permission of instructor

A timetable is not available for this session.
Please refer to the list of Units of Study on the left-hand menu to view the units on offer for the relevant academic year.

The information displayed above is indicative only as online information is subject to change without notice. The Faculty Handbook and the University of Sydney Calendar are the official legal source of information relating to study at the University of Sydney