2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: PHIL252

PHIL 252: Computability and Logic (PHIL 152)

Kurt G¿del's ground-breaking Incompleteness Theorems demonstrate fundamental limits on formal mathematical reasoning. In particular, the First Incompleteness Theorem says, roughly, that for any reasonable theory of the natural numbers there are statements in the language that are neither provable nor refutable in that theory. In this course, we will explore the expressive power of different axiomatizations of number theory, on our path to proving the Incompleteness Theorems. This study entails an exploration of models of computation, and the power and limitations of what is computable, leading to an introduction to elementary recursion theory. At the conclusion of the course, we will discuss technical and philosophical repercussions of these results. Prerequisite: 151/251.
Terms: Spr | Units: 4
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints