Division by three
Division by threePeter G. DoyleJohn Horton Conway Version dated 1994GNU FDL AbstractWe prove without appeal to the Axiom of Choice that for any setsAandB, if there is a one-to-one correspondence between 3 Aand3 Bthen there is a one-to-one correspondence first such proof, due to Lindenbaum, was announced by Linden-baum and Tarski in 1926, and subsequently lost ; Tarski publishedan alternative proof in 1949. We argue that the proof presented herefollows Lindenbaum s Classification numbers03E10 (Primary); 03E25 (Sec-ondary).1 IntroductionIn this paper we show that it is possible to divide by three . Specifically,we prove that for any setsAandB, if there is a one-to-one correspondencebetween 3 Aand 3 Bthen there is a one-to-one correspondence between John Conway collaborated on the research reported here, and has been listed as anauthor of this work since it was first distributed in 1994.
Division by three Peter G. Doyle John Horton Conway Version dated 1994 GNU FDLy Abstract We prove without appeal to the Axiom of Choice that for any sets A and B, if there is a one-to-one correspondence between 3 A and 3 B then there is a one-to-one correspondence between A and B.
Download Division by three
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
Ask Three Before Me, Three, Herbicide, THREE HERBICIDE, CDMS, AMENDMENT OF THE THREE STRIKES SENTENCING, The three, The Three-Point Problem, CT Birth to Three Feasibility Study, Connecticut, Three Tenets for Secure Cyber-Physical System, Matrix Elimination to Solve Three Equations, THREE RIVERS STATE GAME AREA