• Title/Summary/Keyword: 괴델

Search Result 23, Processing Time 0.061 seconds

A reconstruction of the G$\ddot{o}$del's proof of the consistency of GCH and AC with the axioms of Zermelo-Fraenkel set theory

  • Choi, Chang-Soon
    • Journal for History of Mathematics
    • /
    • v.24 no.3
    • /
    • pp.59-76
    • /
    • 2011
  • Starting from a collection V as a model which satisfies the axioms of NBG, we call the elements of V as sets and the subcollections of V as classes. We reconstruct the G$\ddot{o}$del's proof of the consistency of GCH and AC with the axioms of Zermelo-Fraenkel set theory by using Mostowski-Shepherdson mapping theorem, reflection principles in Tarski-Vaught theorem and Montague-Levy theorem and the fact that NBG is a conservative extension of ZF.

Hilbert's Program as Research Program (연구 프로그램으로서의 힐버트 계획)

  • Cheong, Kye-Seop
    • Journal for History of Mathematics
    • /
    • v.24 no.3
    • /
    • pp.37-58
    • /
    • 2011
  • The development of recent Mathematical Logic is mostly originated in Hilbert's Proof Theory. The purpose of the plan so called Hilbert's Program lies in the formalization of mathematics by formal axiomatic method, rescuing classical mathematics by means of verifying completeness and consistency of the formal system and solidifying the foundations of mathematics. In 1931, the completeness encounters crisis by the existence of undecidable proposition through the 1st Theorem of G?del, and the establishment of consistency faces a risk of invalidation by the 2nd Theorem. However, relative of partial realization of Hilbert's Program still exists as a fruitful research program. We have tried to bring into relief through Curry-Howard Correspondence the fact that Hilbert's program serves as source of power for the growth of mathematical constructivism today. That proof in natural deduction is in truth equivalent to computer program has allowed the formalization of mathematics to be seen in new light. In other words, Hilbert's program conforms best to the concept of algorithm, the central idea in computer science.

Mathematical truth and Provability (수학적 참과 증명가능성)

  • Jeong, Gye-Seop
    • Korean Journal of Logic
    • /
    • v.8 no.2
    • /
    • pp.3-32
    • /
    • 2005
  • Hilbert's rational ambition to establish consistency in Number theory and mathematics in general was frustrated by the fact that the statement itself claiming consistency is undecidable within its formal system by $G\ddot{o}del's$ second theorem. Hilbert's optimism that a mathematician should not say "Ignorabimus" ("We don't know") in any mathematical problem also collapses, due to the presence of a undecidable statement that is neither provable nor refutable. The failure of his program receives more shock, because his system excludes any ambiguity and is based on only mechanical operations concerning signs and strings of signs. Above all, $G\ddot{o}del's$ theorem demonstrates the limits of formalization. Now, the notion of provability in the dimension of syntax comes to have priority over that of semantic truth in mathematics. In spite of his failure, the notion of algorithm(mechanical processe) made a direct contribution to the emergence of programming languages. Consequently, we believe that his program is failure, but a great one.

  • PDF