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 Pyes of code number of formulas that are provable in T and the set Pno of code numbers of formulas that are disprovable in P Show that there is no recursive set R such that Pyes is a subset of R while no element of R is an element of Pno
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
