All Questions
Tagged with forcing computability-theory
2 questions
8
votes
2
answers
473
views
Does forcing with recursively pointed perfect trees add a Turing degree that is minimal over $V$?
A tree $T$ on $\omega$ is recursively pointed if it is recursive in each of its branches. We can consider a variant of Sacks forcing where the conditions are recursively pointed perfect trees ordered ...
8
votes
3
answers
745
views
Natural statements independent from true $\Pi^0_2$ sentences
I am looking for sentences in the language of first order arithmetic ($0,1,+,\cdot,\leq$) which are independent from $\Pi^0_2$ consequences of true arithmetic $\Pi^0_2\text{-}\mathsf{Th}(\mathbb{N})$. ...