PHL 416 - Mathematical Logic

Institution:

University of Rochester

Subject:

Description:

The central goal of this course is to study some of the most surprising and important results about the inherent limitations of logic, including Gödel’s first incompleteness theorem, Tarski’s theorem on the indefinability of truth, and Church’s theorem on the undecidability of logic. Topics covered along the way include Turing computability and Gödel’s completeness theorem for first-order logic. The focus throughout will be on developing an understanding of the relations between truth, validity, provability, and computability.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.rochester.edu

Phone Number:

(888) 822-2256

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.