Question: Let T be consistent, axiomatizable theory extending Q . Consider the set P ^ yes of ( code number of ) formulas that are provable

Let T be consistent, axiomatizable theory extending Q. Consider the set P^yes of (code number of) formulas that are provable in T, and the set P^no of (code numbers of) formulas that are disprovable in P. Show that there is no recursive set R such that P^yes is a subset of R while no element of R is an element of P^no.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!