contents/computer_science.tex : Renamed 'denumbrability' to countability and added more theorems and properties

graphs/countable_integers.gv

@@ -1,29 +0,0 @@
-digraph denumberabilityIntegers {
-	node [shape = plaintext, fontcolor = White, fontsize = 30];
-	rankdir = LR;
-	bgcolor = None;
-	Edge [fontcolor = White, color = White, fontsize = 25];
-
-	subgraph pos {
-		Edge [constraint = False];
-		 0 -> 1 [taillabel = 0];
-		-1 -> 2 [taillabel = 2];
-		-2 -> 3 [taillabel = 4];
-		-3 -> 4 [taillabel = 6];
-		-4 -> 5 [taillabel = 8];
-	}
-	subgraph neg {
-		Edge [constraint = False];
-		1 -> -1 [taillabel = 1];
-		2 -> -2 [taillabel = 3];
-		3 -> -3 [taillabel = 5];
-		4 -> -4 [taillabel = 7];
-		5 -> -5 [taillabel = 9];
-	}
-	subgraph dots {
-		node [label = "..."];
-		d; md;
-	}
-
-	md -> -5 -> -4 -> -3 -> -2 -> -1 -> 0 -> 1 -> 2 -> 3 -> 4 -> 5 -> d [color = None];
-}