《离散数学》课程融入数学文化的教学实践
Teaching Practice of Integrating Mathematical Culture into the “Discrete Mathematics” Course
摘要: 将数学文化融入高校数学专业课是落实课程思政的重要途径。本文挖掘了华人逻辑学家王浩在计算理论中的若干重要成果，将其转化为面向数学师范生《离散数学》课程的教学案例。通过该案例的教学实践，学生在掌握专业知识的同时，加深了对中国学者在当代数学发展中历史贡献的认识，实现了知识传授与数学文化熏陶的统一。
Abstract: Integrating mathematical culture into mathematics courses in higher education is an important approach to implementing curriculum-based ideological and political education. This paper explores several key achievements of the Chinese logician Hao Wang in the theory of computation and transforms them into a teaching case for the “Discrete Mathematics” course designed for mathematics education majors. Through the teaching practice of this case, students not only acquire professional knowledge but also deepen their understanding of the historical contributions made by Chinese scholars to the development of contemporary mathematics, thereby achieving the unity of knowledge transmission and the cultivation of mathematical culture.
文章引用：陈梅璇, 杨超. 《离散数学》课程融入数学文化的教学实践[J]. 教育进展, 2026, 16(6): 571-576. https://doi.org/10.12677/ae.2026.1661165

参考文献

[1] 教育部高等学校教学指导委员会. 普通高等学校本科专业类教学质量国家标准[M]. 北京: 高等教育出版社, 2018.
[2] 中华人民共和国教育部. 教育部关于印发《高等学校课程思政建设指导纲要》的通知: 教高〔2020〕3号[EB/OL]. 2020-06-01.
http://www.moe.gov.cn/srcsite/A08/s7056/202006/t20200603_462437.html, 2026-04-13.
[3] 中华人民共和国教育部. 普通高中数学课程标准（2017年版2020年修订）[S]. 北京: 人民教育出版社, 2020.
[4] 张奠宙, 王善平. 王浩[M]//《科学家传记大辞典》编辑组. 中国现代科学家传记. 第6集. 北京: 科学出版社, 1994: 97-110.
[5] Wang, H. (1957) A Variant to Turing’s Theory of Computing Machines. Journal of the ACM, 4, 63-92. [Google Scholar] [CrossRef] 
[6] Minsky, M.L. (1967) Computation: Finite and Infinite Machines. Prentice-Hall.
[7] Wang, H. (1961) Proving Theorems by Pattern Recognition—II. Bell System Technical Journal, 40, 1-41. [Google Scholar] [CrossRef] 
[8] Greenfeld, R. and Tao, T. (2024) A Counterexample to the Periodic Tiling Conjecture. Annals of Mathematics, 200, 301-363. [Google Scholar] [CrossRef] 
[9] Berger, R. (1964) The Undecidability of the Domino Problem. Ph.D. Thesis, Harvard University.
[10] Poonen, B. (2014) Undecidable Problems: A Sampler. In: Kennedy, J., Ed., Interpreting Gödel, Cambridge University Press, 211-241. [Google Scholar] [CrossRef] 
[11] Gamegix. Tetravex 3 × 3.
https://gamegix.com/tetravex/game?size=3
[12] 张尚水. 美籍数理逻辑学家王浩教授在京作学术报告[J]. 哲学研究, 1978(Z1): 96-99.
[13] 王浩. 数理逻辑通俗讲话[M]. 北京: 科学出版社, 1981.
[14] Cook, S.A. (1971) The Complexity of Theorem-Proving Procedures. Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, Shaker Heights, 3-5 May 1971, 151-158. [Google Scholar] [CrossRef] 
[15] ACM (2015) Stephen Arthur Cook—A.M. Turing Award Laureate.
https://amturing.acm.org/award_winners/cook_n991950.cfm
[16] ACM (2026) An Interview with Stephen Cook.
https://amturing.acm.org/interviews/cook_n991950.cfm
[17] 迈克尔·西普塞. 计算理论导引[M]. 原书第3版. 段磊, 唐常杰, 译. 北京: 机械工业出版社, 2015.
[18] Sipser, M. (2018) Introduction to the Theory of Computation. 3rd Edition, China Machine Press.

为你推荐