Problems with technical assumptions in prior versions of Cox's theorem are explored. Remedies are proposed by restricting attention to propositional plausibilities. An invariance principle due to Jaynes is used to construct equiplausible examples. From these examples and assumptions an elementary proof of Cox's theorem follows.