Set Theory and Logic

How to Create a System of Relations Capable of Challenging Cantor's Theorem

Authors: Juan Carlos Caso Alonso
Comments: 138 Pages. English. Contact: recursos dot clja at gmail dot com

This is not a paper, this is a letter, to convince others to create a formal academic document, exactly with the literary details, and style, international math community likes. This is all about how to build a system of relations. And I can provide all mathematical details, but not in academic style. Once that system is created we will define two different cardinal games, technics, based in the system, to compare infinite quantities of elements inside two concrete sets: P(N) and N. Both technics, existing and interacting, have an extraordinary property (8 years of experience, many different experts): experts tends to guarantee, very sure about themself, while they try to deny the weak point of one, that the other one is a perfect practical equivalence of an injectivity r: P(N) -> N. THEY, not me, guaranteed it. But they never have got patience to see the consequences of their elections, seeing the other technic. I give all the details about the system of relations and the two technics. In reallity we are creating a proof with two paths, where both paths drives to the same conclussion: Cantor's Theorem is false. This is just one concrete case, applied with all details, of a more general algorithm, for other sets or alephs. I am not going to explain it inside this document. This letter is too, to convince some people to help me to create proper documents, about the algorithm, and check the rest of my discoveries. For example, until WHICH aleph, until which set, we are able to prove it has a quantity of elements NOT BIGGER than N has, using concrete mathematical relations.
Category: Set Theory and Logic