Implications of Pessiland
The only world in which NP-complete problems (e.g. 3sat, 3colorability, traveling salesman)  are solvable in polynomial time is Algorithmica, i.e. $P=NP$.

The rest of them refer to various conjectures that might hold within $P\neq NP$, for example $NP$ problems are hard/easy on average, or one way functions do/don't exist.