PL 3014 - Metalogic

Institution:

Polytechnic Institute of New York University

Subject:

Description:

This course demonstrates the soundness and completeness of first-order logic, the G?del incompleteness theorem for formal arithmetic, and reviews Turing machines and the notions of computability and undecidability. Prerequisite: PL 2104 or a strong mathematical background (third-/fourth-year mathematics major).

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Multiple

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.poly.edu

Phone Number:

(718) 260-3100

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.