Effective inseparability and some applications in meta-mathematics
Abstract
Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability. We give a much simpler proof of these equivalences using the strong double recursion theorem. Then we prove some results about the application of effective inseparability in meta-mathematics.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.