Recursive and non recursive formulas in finitism

スポンサーリンク

概要

• 論文の詳細を見る

• This report shows that the diagonalization in the set of all finite length unary functions (formulas) produces a non-finite length function (formula) under a strict finitism. This fact gives a chance to review several established theories such as the first incompleteness theorem, the diagonal theorem, a typical proof of the halting problem of a Turing machine, and so on. A finitism without the concept of infinity does not cover the Godel's world.

• 一般社団法人電子情報通信学会の論文
• 2012-06-14

著者

• TANAKA Eiichi

  Kobe University

関連論文

• Two Dimensional Largest Common Subpatterns between Pictures
• Recursive and non recursive formulas in finitism
• Recursive and non recursive formulas in finitism

スポンサーリンク