User:IssaRice/Computability and logic/Diagonalization lemma (Yanofsky method): Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
. | This page is just a rewritten version of the [https://arxiv.org/pdf/math/0305282.pdf#section.5 proof of the diagonalization lemma from Yanofsky's paper]. There are some parts I found difficult to understand/gaps that I thought should be filled, so this version will hopefully be much more complete. | ||
Acknowledgments: Thanks to Rupert McCallum for helping me work through the proof. | |||
==See also== | ==See also== | ||
* [[User:IssaRice/Computability_and_logic/Diagonalization_lemma]] | * [[User:IssaRice/Computability_and_logic/Diagonalization_lemma]] | ||
Revision as of 20:23, 27 July 2021
This page is just a rewritten version of the proof of the diagonalization lemma from Yanofsky's paper. There are some parts I found difficult to understand/gaps that I thought should be filled, so this version will hopefully be much more complete.
Acknowledgments: Thanks to Rupert McCallum for helping me work through the proof.