A Computability Proof of Gödel’s First Incompleteness Theorem A computability proof of Gödel’s incompleteness theorem equally as strong as Gödel’s version, but much easier to deduce
The Envy-Free Cake-Cutting Procedure How to Ensure Fairness as a Mechanistic Outcome. Implications for policy?