|
|
|
|
|
|
by ProfHewitt
2117 days ago
|
|
|
In powerful mathematical theories for the foundations of Computer Science the sentence G does not exist. In fact there is no particular proposition that is known to be inferentially undecidable. See the following: https://papers.ssrn.com/abstract=3457802 |
|
|