Tag
This paper uses SAT solving to prove that the smallest countermodels for Tarski's high school algebra problem are of size 12, providing a classification and verifying the result in Lean.
A new type of zero-knowledge proof leverages Gödel's incompleteness theorems to overcome previous limitations of secrecy, establishing a striking connection between mathematical logic and cryptography.