Abstract
Inseparability notions are concerned with describing how hard it is to put a “fence” between two disjoint sets. Kleene [Kle52,Rog67] introduced the first such notion, recursive inseparability. We say a set S separates A from B if and only if A ⊆ S ⊆ \(\bar B\), i.e., S is a fence around A that separates it from B. Two sets A and B are recursively inseparable if and only if A and B are disjoint and there is no recursive set that separates A from B. The motivation for this notion came from Gödel’s First Incompleteness Theorem [Göd86,Men86]: Kleene noted [Kle52,Rog67] that the set of sentences P provable in Peano Arithmetic is recursively inseparable from the set of sentences R refutable in Peano Arithmetic. If a complete, recursive axiomatization of arithmetic existed, its deductive closure C would be a recursive set separating P from R.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Royer, J.S., Case, J. (1994). Inseparability Notions. In: Subrecursive Programming Systems. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0249-3_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0249-3_8
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6680-8
Online ISBN: 978-1-4612-0249-3
eBook Packages: Springer Book Archive