Stanford University Explore Courses

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: Hawke, P. (PI) ; Gottlieb, D. (TA) ; Zaffora Blando, F. (TA)

2016-2017 Winter

PHIL 151 | 4 units | UG Reqs: GER:DB-Math, WAY-FR | Class # 10523 | Section 01 | Grading: Letter or Credit/No Credit | LEC | Session: 2016-2017 Winter 1 | In Person | Students enrolled: 47
01/09/2017 - 03/17/2017 Mon, Wed, Fri 9:30 AM - 10:20 AM at School of Education 128 with Hawke, P. (PI)
Exam Date/Time: 2017-03-21 8:30am - 11:30am (Exam Schedule)
Instructors: Hawke, P. (PI)
Additional Resources: (Login to view additional resources)
PHIL 151 | UG Reqs: GER:DB-Math, WAY-FR | Class # 15436 | Section 02 | Grading: Letter or Credit/No Credit | DIS | Session: 2016-2017 Winter 1 | In Person | Students enrolled: 12
01/09/2017 - 03/17/2017 Mon 4:30 PM - 5:20 PM at 90-92Q
PHIL 151 | UG Reqs: GER:DB-Math, WAY-FR | Class # 15480 | Section 03 | Grading: Letter or Credit/No Credit | DIS | Session: 2016-2017 Winter 1 | In Person | Students enrolled: 7
01/09/2017 - 03/17/2017 Mon 5:30 PM - 6:20 PM at 200-107 with Gottlieb, D. (TA)
Instructors: Gottlieb, D. (TA)
PHIL 151 | UG Reqs: GER:DB-Math, WAY-FR | Class # 34509 | Section 04 | Grading: Letter or Credit/No Credit | DIS | Session: 2016-2017 Winter 1 | In Person | Students enrolled: 6
01/09/2017 - 03/17/2017 Wed 10:30 AM - 11:20 AM at 20-21G with Zaffora Blando, F. (TA)
Instructors: Zaffora Blando, F. (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

1 - 2 of 2 results for: PHIL151

PHIL 151: Metalogic (PHIL 251)

2016-2017 Winter

PHIL 151A: Recursion Theory (PHIL 251A)