Abstract

It is proved that the set of Godel numbers of realizable predicate formulas is not definable in the language of formal arithmetic.Bibliography: 13 titles.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call