Uniwersalność systemów funkcyjnych a całkowitość dziedzin funkcji – granice konfliktu i wzajemnego wpływu
##plugins.themes.bootstrap3.article.sidebar##
Opublikowane:
gru 28, 2017
Słowa kluczowe:
universality total functions computability
##plugins.themes.bootstrap3.article.main##
Abstrakt
The article presents several examples of different mathematical structures and interprets their properties related to the existence of universal functions. In this context, relations between the problem of totality of elements and possible forms of universal functions are analyzed. Furthermore, some global and local aspects of the mentioned functional systems are distinguished and compared. In addition, the paper attempts to link universality and totality with the dynamic and static properties of mathematical objects and to consider the problem of limitations in the construction of structures combining harmoniously the availability of information at the local and global level.
##plugins.themes.bootstrap3.article.details##
Jak cytować
Mycka, J. (2017). Uniwersalność systemów funkcyjnych a całkowitość dziedzin funkcji – granice konfliktu i wzajemnego wpływu. Zagadnienia Filozoficzne W Nauce, (63), 31–58. Pobrano z https://www.zfn.edu.pl/index.php/zfn/article/view/404
Numer
Dział
Artykuły
Bibliografia
Bell, J.L., 2014. Intuitionistic set theory. London: College Publications.
Bolander, T., 2002. Restricted truth predicates in first order logic. In: The logica 2002 yearbook. Praha: Filosofia.
Chaitin, G., 2004. Algorithmic information theory. Cambridge: Cambridge University Press.
Hall, B.C., 2013. Quantum theory for mathematicians. New York et al.: Springer.
Hrbacek, K., Jech, T., 1999. Introduction to set theory. 3rd edition. Boca Raton, Fl.: Chapman & Hall/CRC.
Kharazishvili, A., 2005. Strange functions in real analysis. 2nd edition. Boca Raton, Fl.: Chapman & Hall/CRC.
Odifreddi, P., 1992. Classical recursion theory: The theory of functions and sets of natural numbers. Vol. I. Amsterdam: North Holland.
Rogers, H., 1987, Theory of recursive functions and effective computability. Mabridge, Mass.: MIT Press.
Shen, A., Vereshchagin, N., 2002. Computable functions. Providence, RI: American Mathematical Society.
Bolander, T., 2002. Restricted truth predicates in first order logic. In: The logica 2002 yearbook. Praha: Filosofia.
Chaitin, G., 2004. Algorithmic information theory. Cambridge: Cambridge University Press.
Hall, B.C., 2013. Quantum theory for mathematicians. New York et al.: Springer.
Hrbacek, K., Jech, T., 1999. Introduction to set theory. 3rd edition. Boca Raton, Fl.: Chapman & Hall/CRC.
Kharazishvili, A., 2005. Strange functions in real analysis. 2nd edition. Boca Raton, Fl.: Chapman & Hall/CRC.
Odifreddi, P., 1992. Classical recursion theory: The theory of functions and sets of natural numbers. Vol. I. Amsterdam: North Holland.
Rogers, H., 1987, Theory of recursive functions and effective computability. Mabridge, Mass.: MIT Press.
Shen, A., Vereshchagin, N., 2002. Computable functions. Providence, RI: American Mathematical Society.