PHIL-UA 75

Computability and Incompleteness

New York University · UGRD · Fall 2026

1 section

Catalog description

An introduction to the theory of computability and to the major limitative results of mathematical logic, including the undecidability of first-order logic, Gödel's incompleteness theorems, and Tarski's theorem on the non-definability of truth.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 13 hours ago

001

Availability not recently verified

Class #new_york-PHILUA75Fall 2026UGRD4 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?