On Mar 28, 2:49 am, barry barrett <barry3...@hotmail.com> wrote: > > Why > > would you think > > it "bigger" than any other assumption > > This amounts to assuming expressibilty- and then of course Godel's theorem applies. > > Assuming Prop V just makes everything too easy. Godel's theorem immediately follows. > > It would be much more interesting if you could show that Prop V is a consequence of some very general features of the system. (maybe of conditions 1 & 2 -recursiveness of the axioms and inference rules {but you said earlier that this isn't the case}).
Okay, yes, we do look for certain properties of a given system S that imply that Theorem V holds for S. Such things as S is an extension of Robinson arithmetic (or that Robinson arithmetic can be embedded in S).
