FORMAL EDGE / SELF-REFERENCE MACHINE 10
A library tries to read itself.
Watch formal rules successfully print proofs, then let the machinery acquire a coded reflection of itself. The limit arrives from inside the library rather than from an outside examiner.
No quiz. Touch the machine and watch what happens.
PLAY FIRST / THE SELF-READING LIBRARY
Let a library of proofs learn to speak about its own machinery.
First print what a rule-bound formal system can prove. Then encode the machinery inside arithmetic. Finally turn the system back toward itself and watch complete formal capture come under pressure.
No slogan required: experience the architecture—rules → enumerable proofs → self-reference → a limit from inside.
GÖDEL / SELF-READING LIBRARY
Proof is not the same thing as truth.
2+2=4
prime facts
coded proofs
arithmetic rules
unwritten
Start with a machine that can mechanically enumerate formal proofs.
What you just saw
The idea arrives after the spectacle.
Effective rulesA formal proof system can mechanically enumerate successful finite derivations.
Self-referenceArithmetic is expressive enough to encode statements about the system's own proof machinery.
The boundaryUnder Gödel's hypotheses, a sufficiently strong consistent effective system cannot perfectly close over every arithmetic truth from inside itself.
Independent educational interpretation inspired by Agustín Rayo’s work and course materials. Public wording, visuals, and interactions are original to The Mercurial World; no collaboration, review, sponsorship, endorsement, or approval is implied.