Talk:Computability logic

This entry strikes me as self-advertising by Mr. Japaridze. There are quite a few "computational logics" like this one; an expert should decide whether Mr Japaridze's theory is such a break-through as to deserve a single entry to itself.

We have User:Charles Stewart's opinion on this. Charles Matthews 08:20, 5 October 2005 (UTC)

Well what was his opinion? I'm a graduate student in logic studying computability and I read through a fair fraction of his paper before giving up in disinterest. It seems to be valid work (as I would expect given where it is published) but I saw nothing very earth-shattering about it. Most of it was fairly natural (though notationally complex) generalizations of the standard theory of two player games and the well known isomorphism between sentences written in prenex normal form and games. I'm not saying his work isn't usefull or interesting but there is no reason to believe it is any more so than the many various logics published in mathematics and CS journals. In particular the fact that the computability logic page seems to be mostly papers by him suggests that it is just another academics research program that may or may not turn out to amount to much. I don't have a problem with their being a page somewhere on wikipedia describing it but I'm getting tired or running into links about it whenever I'm editing pages on computability theory. At the very least something should be done to make it clear this isn't some widely accepted/used theory. Logicnazi

Well, this is a reference work, and will over-inform some people accordiong to their needs. I would agree that there were initially too prominent and too many links to it. I kept an eye on those for a while. Any that are misplaced can be removed, within reason. User:Chalst is actually very positive about the underlying work. (By the way your chosen user name will not always get you a fair hearing here.) Charles Matthews 10:13, 23 October 2005 (UTC)