A paper by Hintikka about the modified Ramsey theorem

Sun Jul 25 09:03:38 EDT 2021

Does anyone have a citation for this Hintikka article?  —RR

On Jul 24, 2021, at 11:48 AM, Giovanni Lagnese <giov.lagn at gmail.com<mailto:giov.lagn at gmail.com>> wrote:

      External Email - Use Caution

Is this paper by Hintikka correct? https://iphras.ru/uplfile/logic/log19/LI19_Hintikka.pdf<https://nam02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fiphras.ru%2Fuplfile%2Flogic%2Flog19%2FLI19_Hintikka.pdf&data=04%7C01%7Cryno%40jhu.edu%7Ca1c7a563d8ed4f3a709308d94ef4f327%7C9fa4f438b1e6473b803f86f8aedf0dec%7C0%7C0%7C637627636224687742%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=dru3%2Bk29zHitAXBRxPamVNBG9HAE2RheolreORnHIu0%3D&reserved=0>

"Yet f is obviously computable by a mechanical process, for we can simply by going through for a given m all the possible relations R (different 'colorings') for n = m, m + 1, m + 2, . . . Hence MFRT appears to be highly interesting even if it is not a Godel sentence. It is a counterexample to Church's Thesis: in a pretheoretical sense computable, but not general recursive nor therefore a Turing machine computable function." (!!)

-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20210725/4064961a/attachment-0001.html>