Logic II

Provided by:
0/10 stars
based on  0 reviews
Provided by:
Cost FREE
Start Date On demand

Course Details

Cost

FREE

Upcoming Schedule

  • On demand

Course Provider

MIT online courses
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,200 courses available, OCW is delivering on the promise of open sharing of knowledge.
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,200 courses available, OCW is delivering on the promise of open sharing of knowledge.
Provider Subject Specialization
Humanities
Sciences & Technology
4 reviews

Course Description

This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can recognize as true even though they don't follow from the system of axioms. In my opinion, which is widely shared, this is the most important single result in the entire history of logic, important not only on its own right but for the many applications of the technique by which it's proved. We'll discuss some of these applications, among them: Church's theorem that there is no algorithm for deciding when a formula is valid in the predicate calculus; Tarski's theorem that the set of true sentence of a language isn't definable within that language; and Gödel's second incompleteness theorem, which says ...

This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel's theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can recognize as true even though they don't follow from the system of axioms. In my opinion, which is widely shared, this is the most important single result in the entire history of logic, important not only on its own right but for the many applications of the technique by which it's proved. We'll discuss some of these applications, among them: Church's theorem that there is no algorithm for deciding when a formula is valid in the predicate calculus; Tarski's theorem that the set of true sentence of a language isn't definable within that language; and Gödel's second incompleteness theorem, which says that no consistent system of axioms can prove its own consistency.

Logic II course image
Reviews 0/10 stars
0 Reviews for Logic II

Ratings details

  • 5 stars
  • 4 stars
  • 3 stars
  • 2 stars
  • 1 stars
  • 5 stars
  • 4 stars
  • 3 stars
  • 2 stars
  • 1 stars
  • 5 stars
  • 4 stars
  • 3 stars
  • 2 stars
  • 1 stars

Rankings are based on a provider's overall CourseTalk score, which takes into account both average rating and number of ratings. Stars round to the nearest half.

No reviews yet. Be the first!

Rating Details


  • 5 stars
  • 4 stars
  • 3 stars
  • 2 stars
  • 1 stars
  • 5 stars
  • 4 stars
  • 3 stars
  • 2 stars
  • 1 stars
  • 5 stars
  • 4 stars
  • 3 stars
  • 2 stars
  • 1 stars

Rankings are based on a provider's overall CourseTalk score, which takes into account both average rating and number of ratings. Stars round to the nearest half.