• Communications of Mathematical Education
• /
• v.15
• /
• pp.1-7
• /
• 2003

수학사 및 수리철학에 관한 연구는 교사양성 대학에서 더욱 강조되어야 할 부분임에도 불구하고 그에 관한 연구가 미진하다. 자연대의 수학과는 수학 그 자체가 중요하겠지만, 교사양성 대학에서는 수학 내용자체 뿐만 아니라, 수학의 역사적인 측면과 수학에 관한 인식론적인 측면이 함께 요구되어 진다. 절대적인 것으로 인식되어 온 수학에 대한 잘못된 선입견은 수학교육에도 심각한 악영향을 끼칠 수 있다. 그러나 괴델의 불완전성 정리 등으로 인해 수학에서의 논리체계는 더 이상 절대적이지 않다는 것을 알 수 있다. 본 연구에서는 숱한 오류들의 극복을 통해 발전해 온 수학사적인 측면과 그로 인하여 수학에 관한 인식론적 변화를 수학에서의 큰 사건들을 중심으로 살펴보고자 한다. 구체적으로 유클리드 기하에서 비유클리드 기하의 발견, 칸토어의 무한한 역설의 발생, 역설을 극복하기 위한 수학기토론의 탄생, 괴델의 불완전성 정리로 이어지는 과정들을 살펴보고, 그로 인해 도출되어지는 수학교육적 시사점을 논의해 보며, 이르르 바탕으로 교사양성 대학에서의 수학사 및 수리철학 강좌의 운영 방안을 제시한다.

• Annual Conference on Human and Language Technology
• /
• 1995.10a
• /
• pp.258-263
• /
• 1995

마음과 기계의 관계에 대한 $G{\ddot{o}}del's$의 선언결론(disjunctive conclusion)은 마음과 정보처리형식체계의 논리적 동치성을 함의하고 있다. 그리고 $G{\ddot{o}}del's$의 불완전성 정리(Incompleteness Theorems)에 따르면 마음과 정보처리형식체계의 논리적 동치성은 무모순이며, 동치성 반증의 이론은 그 모델을 가질 수 없다.

• 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.

• Korean Journal of Cognitive Science
• /
• v.23 no.3
• /
• pp.367-388
• /
• 2012

The centennial of Alan Mathison Turing(23 June 1912 - 7 June 1954) is an appropriate occasion on which to assess his profound influence on the development of cognitive science. His contributions to and attitudes toward that field are discussed from the metamathematical perspective. This essay addresses (i)Turing's mathematical analysis of cognition, (ii)universal Turing machines, (iii)the limitations of universal Turing machines, (iv)oracle Turing machine beyond universal Turing machine, and (v)Turing test for cognitive science. Turing was a ground-breaker, eager to move on to new fields. He actually opened wider the scientific windows to the mind. The results show that first, by means of mathematical logic Turing discovered a new bridge between the mind and the physical world. Second, Turing gave a new formal analysis of operations of the mind. Third, Turing investigated oracle Turing machines and connectionist network machines as new models of minds beyond the limitations of his own universal machines. This paper explores why the cognitive scientist would be ever expecting a new Turing Test on the shoulder of Alan Turing.

• 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.

• 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.