Diagonalization in double frames
Logica Universalis 4 (1) (2010)
| Abstract | We consider structures of the form (Φ, Ψ, R ), where Φ and Ψ are non-empty sets and is a relation whose domain is Ψ. In particular, by using a special kind of a diagonal argument, we prove that if Φ is a denumerable recursive set, Ψ is a denumerable r.e. set, and R is an r.e. relation, then there exists an infinite family of infinite recursive subsets of Φ which are not R -images of elements of Ψ. The proof is a very elementary one, without any reference even to e.g. the -theorem. Some consequences of the main result are also discussed. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesGiangiacomo Gerla (1987). Decidability, Partial Decidability and Sharpness Relation for L-Subsets. Studia Logica 46 (3):227 - 238.
Peter Clote (1984). A Recursion Theoretic Analysis of the Clopen Ramsey Theorem. Journal of Symbolic Logic 49 (2):376-400.
Peter J. Taylor (1994). Shifting Frames: From Divided to Distributed Psychologies of Scientific Agents. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:304 - 310.
Tamara Lakins Hummel (1994). Effective Versions of Ramsey's Theorem: Avoiding the Cone Above 0'. Journal of Symbolic Logic 59 (4):1301-1325.
Katalin Bimbó (2007). $LE^{T}{Rightarrow}$ , $LR^{Circ}{Wedgesim}$ , LK and Cutfree Proofs. Journal of Philosophical Logic 36 (5):557 - 570.
Analytics
Monthly downloads |
Added to index2010-02-20Total downloads7 ( #134,900 of 556,807 )Recent downloads (6 months)1 ( #64,847 of 556,807 )How can I increase my downloads? |
My notes
Discussion
