Browse
by subject...

Schedule
view...

COVID-19 Scheduling Updates!
See Stanford's HealthAlerts website for latest updates concerning COVID-19 and academic policies.

1 - 2 of 2 results for: PHIL151

printer friendly page

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

Instructors: Icard, T. (PI) ; Friesacher, A. (TA) ; Lawrence, P. (TA) ; Tilton, S. (TA)

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.

Last offered: Winter 2013 | UG Reqs: GER:DB-Math, WAY-FR

Page: 1

1 - 2 of 2 results for: PHIL151

PHIL 151: Metalogic (PHIL 251)

2020-2021 Winter

PHIL 151A: Recursion Theory (PHIL 251A)