Non-Computable, Indiscernible and Uncountable Mathematical Constructions. Sub-Cardinals and Related Paradoxes

Juan-Esteban Palomar Tarancón

Abstract


One of the most important achievements of the last century is the knowledge of the existence of non-countable sets. The proof by Cantor’s diagonal method requires the assumption of actual infinity. By two paradoxes we show that this method sometimes proves nothing because of it can involve self-referential definitions. To avoid this inconvenient, we introduce another proving method based upon the information in the involved object definitions. We also introduce the concepts of indiscernible mathematical construction and sub-cardinal. In addition, we show that the existence of indiscernible mathematical constructions is an unavoidable consequence of uncountability.


Keywords


Remote-cardinals, sub-cardinals, uncountability, indiscernibility, paradoxes

Full Text:

PDF

References


Chaitin, Gregory (2012). How much information can there be in a real number? [reprint of mr2346819]. In: Computation, physics and beyond. Vol. 7160 of Lecture Notes in Comput. Sci.. pp. 247–251. Springer, Heidelberg.

Hulden, Mans (2015). From two-way to one-way finite automata—three regular expression-based methods. In: Implementation and application of automata. Vol. 9223 of Lecture Notes in Comput. Sci.. pp. 176–187. Springer, Cham.

Inoue, Katsushi, Itsuo Takanami, Akira Nakamura and Tadashi Ae (1979). One-way simple multihead finite automata. Theoret. Comput. Sci. 9(3), 311–328.

Kanamori, Akihiro (2012). Set theory from Cantor to Cohen. In: Sets and extensions in the twentieth century. Vol. 6 of Handb. Hist. Log.. pp. 1–71. Elsevier/North-Holland, Amsterdam.

Li, Ming and Paul Vitanyi (2008). An introduction to Kolmogorov complexity and its applications. Texts in Computer Science. third ed.. Springer, New York.

Palomar Tarancón, Juan-Esteban (2016). Co-universal algebraic extension with hidden parameters. Theory Appl.

Math. Comput. Sci. 6(2), 150–169.

Rabin, M. O. and D. Scott (1959). Finite automata and their decision problems. IBM J. Res. Develop. 3, 114–125.

Rado, T. (1962). On non-computable functions. Bell System Tech. J. 41, 877–884.

Ye, Feng (2011). Strict finitism and the logic of mathematical applications. Vol. 355 of Synthese Library. Studies in Epistemology, Logic, Methodology, and Philosophy of Science. Springer, Dordrecht.


Refbacks

  • There are currently no refbacks.