Zobrazeno 1 - 10
of 858
pro vyhledávání: '"Set-builder notation"'
Autor:
Paditz, Ludwig
Publikováno v:
Turning dreams into reality: transformations and paradigm shifts in mathematics education. - Grahamstown: Rhodes University, 2011. - S. 254 - 260
Externí odkaz:
https://slub.qucosa.de/id/qucosa%3A880
https://slub.qucosa.de/api/qucosa%3A880/attachment/ATT-0/
https://slub.qucosa.de/api/qucosa%3A880/attachment/ATT-0/
Autor:
Yanhong A. Liu, Matthew Castellana
Publikováno v:
SIGCSE
Discrete mathematics is the foundation of computer science. It focuses on concepts and reasoning methods that are studied using math notations. It has long been argued that discrete math is better taught with programming, which takes concepts and com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07f47712d818f8c3f1f5607f61ae9e37
http://arxiv.org/abs/2011.14059
http://arxiv.org/abs/2011.14059
Autor:
Graham Priest
Publikováno v:
The Australasian Journal of Logic. 14
A crucial question here is what, exactly, the conditional in the naive truth/set comprehension principles is. In 'Logic of Paradox', I outlined two options. One is to take it to be the material conditional of the extensional paraconsistent logic LP.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06a266797d5a67518d1451743aed7f00
https://doi.org/10.26686/ajl.v14i1.4028
https://doi.org/10.26686/ajl.v14i1.4028
Autor:
Neil Thompson
Publikováno v:
Philosophy Study. 7
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d61724e5daf5498eb50a7414836a8bb
https://doi.org/10.17265/2159-5313/2017.02.005
https://doi.org/10.17265/2159-5313/2017.02.005
Autor:
Beste Güçler
Publikováno v:
Research in Mathematics Education. 16:251-268
Symbols play crucial roles in advanced mathematical thinking by providing flexibility and reducing cognitive load but they often have a dual nature since they can signify both processes and objects of mathematics. The limit notation reflects such dua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75faf80000d4be728a7d611548177e2a
https://doi.org/10.1080/14794802.2014.919872
https://doi.org/10.1080/14794802.2014.919872
Autor:
Carroll Morgan
Publikováno v:
Science of Computer Programming. 85:115-136
The Eindhoven approach to quantifier notation is 40 years old. We extend it by adding “distribution comprehensions” systematically to its repertoire; we believe the resulting notation for elementary probability theory is new. After a step-by-step
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df5d14ef15fcee03c87a95b348ac6f14
https://doi.org/10.1016/j.scico.2013.09.003
https://doi.org/10.1016/j.scico.2013.09.003
Autor:
Stefano Mazzanti
Publikováno v:
Mathematical Logic Quarterly. 59:415-434
In the first half of the 1990s, Clote and Takeuti characterized several function complexity classes by means of the concatenation recursion on notation operators. In this paper, we borrow from computability theory well-known techniques based on pairi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1435bcadecc78c7d9a9e1c10aa99632
https://doi.org/10.1002/malq.201200055
https://doi.org/10.1002/malq.201200055