M. V. Shvetskiy, I. A. Kudryavtseva, M. V. Demidov, A. V. Golanova
Price: 0 руб.
DOI: https://doi.org/10.25807/22224378_2021_12_94
The article defines a new methodological concept “transdisciplinary proof” which is then
used as a tool for selecting the content of teaching theoretical programming, including
some elements of mathematical logic. To illustrate the introduced concept, the authors
consider examples of educational exercises in theoretical programming containing
versions of proofs based on various calculi of mathematical logic. The authors also
classify educational tasks and describe the teaching media which are used to construct
transdisciplinary proofs in the process of teaching theoretical programming.
Keywords: content of teaching, theoretical programming, mathematical logic,
transdisciplinary proof, intuitionistic logic, Curry–Howard isomorphism, Barendregt
logic cube.
References
1. Bocharov V. A., Markin V. I. Vvedenie v logiku. M.: ID «FORUM»: INFRA-M, 2008. 560 s.
2. Vorob’ev N. N. Novyi algorifm vyvodimosti v konstruktivnom ischislenii vyskazyvaniy // Trudy MI AN SSSR im. V. A. Steklova, 1958, T. 52. S. 193–225.
3. Gris D. Nauka programmirovaniya. M.: Mir, 1984. 416 s.
4. Yershov Yu. L., Palyutin E. A. Matematicheskaya logika. M.: Nauka, 1979. 320 s.; 1987. 336 s.
5. Karpenko A. S. Logika na rubezhe tysyacheletiy / V sb.: Logicheskie issledovaniya. Vyp.7. M.: Nauka, 2000, S. 7–60.
6. Karri Kh. Osnovaniya matematicheskoy logiki. M.: Mir, 1969. 568 s.
7. Klini S. K. Vvedenie v metamatematiku. M.: IL, 1957. 526 s.
8. Klini S. K. Matematicheskaya logika. M.: Mir, 1973. 480 s.
9. Kolmogorov A. N., Dragalin A. G. Matematicheskaya logika. Dopolnitel’nye glavy. M.: Izd-vo MGU, 1984. 120 s.
10. Lavrov I. A., Maksimova L. L. Zadachi po teorii mnozhestv, matematicheskoy logike i teorii algoritmov. M.: Fizmatlit, 1995. 256 s.
11. Nepeyvoda N. N. Prikladnaya logika. Izhevsk: Izd-vo Udmurtskogo un-ta, 1997. 385 s.; Novosibirsk:Izd-vo Novosibirskogo un-ta, 2000. 521 s.
12. Ryzhova N. I., Semenova N. I., Shvetskiy M. V. Uprazhneniya po osnovam diskretnoy matematiki:formal’nye yazyki. Chast’ I. SPb.: Izd-vo «Interlayn», 2002. 337 s.
13. Uspenskiy V. A. Prosteyshie primery matematicheskikh dokazatel’stv. M.: MTSNMO, 2009. 56 s.
14. Feys R. Modal’naya logika. M.: Nauka, 1974. 520 s.
15. Tselishchev V. V. Epistemologiya matematicheskogo dokazatel’stva. Novosibirsk: Parallel’, 2006. 212 s.
16. Shvetskiy M. V., Demidov M. V., Golanova A. V., Kudryavtseva I. A. Programmirovanie: matematicheskaya logika. M.: Izdatel’stvo Yurayt, 2020. 675 s.
17. Barendregt H. Lambda calculi with types / Handbook of logic incomputer science. Vol. 2. Oxford University Press, 1993.
18. Hudelmaier J. A PROLOG Program for Intuitionistic Logic // SNS-Bericht, Universität Tübingen, 1988.
19. Vorob’ev N. N. A new algorithm for derivability in the constructive propositional calculus // Amer. Math. Soc. Transl., 1970, v.94(2), p. 37–71.
