Counterexamples to Arrow's Impossibility Theorem in Non-Boolean Topoi

Arrow's Impossibility Theorem is one of the most famous results in economics—it "proves" that no democratic voting system can satisfy four reasonable fairness conditions simultaneously. For 75 years, this has been treated as mathematical proof that perfect democracy is impossible. Turns out? Arrow never specified his theorem only works in classical logic. This paper constructs explicit counterexamples to Arrow's theorem using topos theory (a branch of math that studies different "logical universes"). The key insight: Arrow's proof secretly depends on the Law of Excluded Middle—a classical logic principle that says everything is either true or false, with no in-between. In non-Boolean topoi (mathematical worlds where this principle fails), you can build voting systems where different people are decisive in different contexts, but nobody is a permanent dictator globally. Think rotating presidencies: the EU Council chair rotates every 6 months. At any given time someone's "in charge," but across all time periods, no single person is permanently decisive. That's literally the mathematical structure of our counterexample—and it's been hiding in plain sight in real democratic institutions for decades. The paper introduces the Logical Dependency Factorization (LDF) framework for systematically finding which classical impossibility theorems actually have constructive counterexamples. Arrow's is just the first.