Course page Home page Home page CoursesNew course

Undecidable theories: Mathematical Logic course | Zoonk

32. Undecidable theories

Applies computability and incompleteness to arithmetic, group theory, first-order validity, and other formal theories. Learners use reductions and interpretability to show why no uniform decision method can settle every theory.

Mathematical Logic

Create this chapter

This chapter is part of the course, but it hasn't been created yet. Create it to see all of its lessons.

Create chapterNBack to courseEsc