Set Theory and Logic

    

The Godel's «first Theorem on the Incompleteness of Formal Arithmetic» is not Even a Plausible Hypothesis [«Первая теорема Гёделя о неполноте формальной арифметики» не является даже правдоподобной гипотезой]

Authors: Dmitry Vatolin

In this paper, we prove that the consistent derivation of the "Gödel formula" possible only in a theory in which it is forbidden to fully discuss the evidence. Gödel's assumptions do not follow from unconditional metamathematical axioms. [В настоящей работе доказано, что непротиворечивый вывод «гёделевой формулы» возможен лишь в теории, в которой запрещено полноценно рассуждать о доказательствах. Гёделевы допущения не вытекают из безусловных метаматематических аксиом.]

Comments: 8 Pages. In Russian

Download: PDF

Submission history

[v1] 1 Oct 2010
[v2] 31 Oct 2010
[v3] 6 Apr 2011
[v4] 19 Apr 2011
[v5] 2016-08-26 11:07:55
[v6] 2016-08-28 10:34:48
[v7] 2017-03-23 22:10:04

Unique-IP document downloads: 2122 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus