Print Settings
 

PHIL 151: Metalogic (PHIL 251)

(Formerly 160A.) The syntax and semantics of sentential and first-order logic. Concepts of model theory. Gödel's completeness theorem and its consequences: the Löwenheim-Skolem theorem and the compactness theorem. Prerequisite: 150 or consent of instructor.
Terms: Win | Units: 4 | UG Reqs: GER:DB-Math, WAY-FR | Grading: Letter or Credit/No Credit

PHIL 151A: Recursion Theory (PHIL 251A)

Computable functions, Turing degrees, generalized computability and definability. "What does it mean for a function from the natural numbers to themselves to be computable?" and "How can noncomputable functions be classified into a hierarchy based on their level of noncomputability?". Theory of relative computability, reducibility notions and degree structures. Prerequisite is PHIL 150, or PHIL 151 or CS 103.
Terms: not given this year | Units: 4 | UG Reqs: GER:DB-Math, WAY-FR | Grading: Letter or Credit/No Credit
© Stanford University | Terms of Use | Copyright Complaints