Mathematics – Logic
Scientific paper
2011-06-05
Mathematics
Logic
Scientific paper
Assuming that $0^#$ exists, we prove that there is a structure that can effectively interpret its own jump. In particular, we get a structure $\mathcal A$ such that \[ Sp({\mathcal A}) = \{{\bf x}':{\bf x}\in Sp ({\mathcal A})\}, \] where $Sp ({\mathcal A})$ is the set of Turing degrees which compute a copy of $\mathcal A$. It turns out that, more interesting than the result itself, is its unexpected complexity. We prove that higher-order arithmetic, which is the union of full $n$th-order arithmetic for all $n$, cannot prove the existence of such a structure.
No associations
LandOfFree
A fixed point for the jump operator on structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A fixed point for the jump operator on structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fixed point for the jump operator on structures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-307907