MATH 570 - Introduction to Logic and Computability

Institution:

University of Pennsylvania

Subject:

Description:

Staff. Prerequisite(s): Math 371 or Math 503. Propositional logic: semantics, formal deductions, resolution method. First order logic: validity, models, formal deductions; Godel's completeness theorem, Lowenheim-Skolem theorem: cut-elimination, Herbrand's theorem, resolution method.Computability: finite automata, Turing machines, Godel's incompleteness theorems. Algorithmically unsolvable problems in mathematics.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.upenn.edu

Phone Number:

(215) 898-5000

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.