3 ms·
For me the easiest way to prove Gödel first's with perfect rigor, without bothering with numberings (but using computational undecidability) is here http://user
by michelmichel 7y ago
For me the easiest way to prove Gödel first's with perfect rigor, without bothering with numberings (but using computational undecidability) is here http://users.utu.fi/jkari/automata/fullnotes.pdf http://users.utu.fi/jkari/automata/fullnotes.pdf (Section 4.10)
- noname120 7y agoYou can access directly the relevant section[1] using the `#page=` directive. See here[2] for a full list of parameters you can use. [1] http://users.utu.fi/jkari/automata/fullnotes.pdf#page=134 http://users.utu.fi/jkari/automata/fullnotes.pdf#page=134 [2] https://www.adobe.com/content/dam/acom/en/devnet/acrobat/pdfs/pdf_open_parameters.pdf#page=5 https://www.adobe.com/content/dam/acom/en/devnet/acrobat/pdf...