{"id":1234,"date":"2009-02-20T00:12:01","date_gmt":"2009-02-20T05:12:01","guid":{"rendered":"http:\/\/arxivblog.com\/?p=1234"},"modified":"2009-02-19T18:12:19","modified_gmt":"2009-02-19T23:12:19","slug":"ptarithmetic-reinventing-logic-for-the-computer-age","status":"publish","type":"post","link":"http:\/\/arxivblog.com\/?p=1234","title":{"rendered":"Ptarithmetic: reinventing logic for the computer age"},"content":{"rendered":"<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-1235\" title=\"ptarithmetic\" src=\"http:\/\/arxivblog.com\/wp-content\/uploads\/2009\/02\/ptarithmetic.gif\" alt=\"ptarithmetic\" width=\"414\" height=\"257\" srcset=\"http:\/\/arxivblog.com\/wp-content\/uploads\/2009\/02\/ptarithmetic.gif 834w, http:\/\/arxivblog.com\/wp-content\/uploads\/2009\/02\/ptarithmetic-300x186.gif 300w\" sizes=\"auto, (max-width: 414px) 100vw, 414px\" \/><\/p>\n<p>In the last few years, a small group of logicians have attempted the ambitious task of re-inventing the discipline of formal logic.<\/p>\n<p>In the past, logic has been thought of as the formal theory of &#8220;truth&#8221;.\u00a0 Truth plays an important role in our society and as suchm a formal theory is entirely laudable and worthy. But it is not always entirely useful.<\/p>\n<p>The new approach is to reinvent logic as the formal theory of computability. The goal is\u00a0 to provide a systematic answer to the question &#8220;what is computable&#8221;. For obvious reasons,\u00a0 so-called computability logic may turn out to be much more useful.<\/p>\n<p>To understand the potential of this idea , just think for a moment about the most famous of logical systems called Peano Arithmetic, better known to you and me as &#8220;arithmetic&#8221;.<\/p>\n<p>The idea is for computability logic to do for computation what Peano Arithmetic does for natural numbers.<\/p>\n<p>The role of numbers is played by solvable computations and the collection of basic operations that can be performed on these computations forms the logical vocabulary of the theory.<\/p>\n<p>But there&#8217;s a problem. There can be a big difference between something that is computable and something that is efficiently computable, says Giorgi Japaridze, a logician at Villanova University in Pennsylvania and the inventor of computability logic.<\/p>\n<p>So he is proposing a modification (and why not, it&#8217;s his idea)&#8211;the system should allow only those computations that can be solved in polynomial time. He calls this polynomial time arithmetic or ptarithmetic for short.<\/p>\n<p>The promise is that Japaridze&#8217;s system of logic will prove as useful to computer scientists as arithmetic is for everybody else.<\/p>\n<p>What isn&#8217;t clear is whether the logical vocabulary of ptarithemtic is well enough understood to construct a system of logic around and beyond that, whether ptarithemtic makes a well-formed system of logic at all.<\/p>\n<p>Those are big potential holes which Japaridze\u00a0 may need some help to fill&#8211;even he would have to admit that he&#8217;s been ploughing a lonely furrow on this one since he put forward the idea in 2003.<\/p>\n<p>But the potential pay offs are huge which make this one of those high risk , high potential pay off projects that just might be worth pursuing.<\/p>\n<p>Any volunteers?<\/p>\n<p>Ref: <a href=\"http:\/\/arxiv.org\/abs\/0902.2969\">arxiv.org\/abs\/0902.2969<\/a>: Ptarithmetic<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In the last few years, a small group of logicians have attempted the ambitious task of re-inventing the discipline of formal logic. In the past, logic has been thought of as the formal theory of &#8220;truth&#8221;.\u00a0 Truth plays an important role in our society and as suchm a formal theory is entirely laudable and worthy. [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[21,6,9],"tags":[],"class_list":["post-1234","post","type-post","status-publish","format-standard","hentry","category-calculatin","category-hellraisin","category-mean-machines"],"_links":{"self":[{"href":"http:\/\/arxivblog.com\/index.php?rest_route=\/wp\/v2\/posts\/1234","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/arxivblog.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/arxivblog.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/arxivblog.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/arxivblog.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1234"}],"version-history":[{"count":1,"href":"http:\/\/arxivblog.com\/index.php?rest_route=\/wp\/v2\/posts\/1234\/revisions"}],"predecessor-version":[{"id":1236,"href":"http:\/\/arxivblog.com\/index.php?rest_route=\/wp\/v2\/posts\/1234\/revisions\/1236"}],"wp:attachment":[{"href":"http:\/\/arxivblog.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1234"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/arxivblog.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1234"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/arxivblog.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1234"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}