article · International journal of innovation and applied studies
The resort in arithmetisation of arithmetic reaches to construct inside of arithmetic a proposition which confirm its self indemonstrability. In substance, the proof of coherence presupposes a form of induction in transfinite order for proving the coherence of arithmetic which is the finite order. It is dealing recursive functions which have the properties for all attribute values system to determine them by the means of finite type procedure. It comes to recursive arithmetic, to translate the elements of metatheory formal system.
This page summarises published work. The authoritative version sits with the publisher.
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
