DBpedia – Linked Data Fragments

Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5157263> ?p ?o }

• Q5157263 subject Q7035970.
• Q5157263 subject Q7464734.
• Q5157263 subject Q7470275.
• Q5157263 abstract "Introduced by Giorgi Japaridze in 2003, computability logic is a research program and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic which is a formal theory of truth. In this approach logical formulas represent computational problems (or, equivalently, computational resources), and their validity means being "always computable". Computational problems and resources are understood in their most general - interactive sense. They are formalized as games played by a machine against its environment, and computability means existence of a machine that wins the game against any possible behavior by the environment. Defining what such game-playing machines mean, computability logic provides a generalization of the Church-Turing thesis to the interactive level. The classical concept of truth turns out to be a special, zero-interactivity-degree case of computability. This makes classical logic a special fragment of computability logic. Being a conservative extension of the former, computability logic is, at the same time, by an order of magnitude more expressive, constructive and computationally meaningful. Providing a systematic answer to the fundamental question "what (and how) can be computed?", it has a wide range of potential application areas. Those include constructive applied theories, knowledge base systems, systems for planning and action.Besides classical logic, linear logic (understood in a relaxed sense) and intuitionistic logic also turn out to be natural fragments of computability logic. Hence meaningful concepts of "intuitionistic truth" and "linear-logic truth" can be derived from the semantics of computability logic. Being semantically constructed, as yet computability logic does not have a fully developed proof theory. Finding deductive systems for various fragments of it and exploring their syntactic properties is an area of ongoing research.".
• Q5157263 wikiPageExternalLink j.ic.2008.10.001.
• Q5157263 wikiPageExternalLink 489.
• Q5157263 wikiPageExternalLink exn019.
• Q5157263 wikiPageExternalLink japaridze.ps.
• Q5157263 wikiPageExternalLink citation.cfm?id=1131313.1131318&coll=portal&dl=ACM&idx=1131313&part=periodical&WantType=periodical&title=ACM%20Transactions%20on%20Computational%20Logic%20%28TOCL%29&CFID=71203179&CFTOKEN=21225900.
• Q5157263 wikiPageExternalLink citation.cfm?id=1131313.1131319&coll=portal&dl=ACM&idx=1131313&part=periodical&WantType=periodical&title=ACM%20Transactions%20on%20Computational%20Logic%20%28TOCL%29&CFID=71203179&CFTOKEN=21225900.
• Q5157263 wikiPageExternalLink citation.cfm?id=1808347.1808575.
• Q5157263 wikiPageExternalLink 1174668394.
• Q5157263 wikiPageExternalLink 1268917495&page=record.
• Q5157263 wikiPageExternalLink cl.html.
• Q5157263 wikiPageExternalLink ~japaridz.
• Q5157263 wikiPageExternalLink clx.html.
• Q5157263 wikiPageExternalLink gsoll.html.
• Q5157263 wikiPageExternalLink Japaridze_2007_ActaCybernetica.xml.
• Q5157263 wikiPageExternalLink S016800720300023X.
• Q5157263 wikiPageExternalLink science?_ob=ArticleURL&_udi=B6TYB-4NSWYVP-1&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_version=1&_urlVersion=0&_userid=10&md5=3a7cf451f14038839aba1d27bd89393f.
• Q5157263 wikiPageExternalLink science?_ob=ArticleURL&_udi=B6V1G-4JS1M3B-1&_user=10&_handle=V-WA-A-W-AD-MsSAYWA-UUA-U-AACVWWCADC-AACAYUCEDC-EDADUYDDA-AD-U&_fmt=summary&_coverDate=07%2F25%2F2006&_rdoc=8&_orig=browse&_srch=%23toc%235674%232006%23996429998%23626672!&_cdi=5674&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=8f62c93dd24dd2c3f48cf7c77e05228d.
• Q5157263 wikiPageExternalLink science?_ob=ArticleURL&_udi=B6V1G-4MV758R-2&_user=1536200&_coverDate=01%2F17%2F2007&_alid=540937878&_rdoc=1&_fmt=summary&_orig=search&_cdi=5674&_sort=d&_docanchor=&view=c&_ct=2&_acct=C000053374&_version=1&_urlVersion=0&_userid=1536200&md5=ce039afe954def15cbd8e9438488f011.
• Q5157263 wikiPageExternalLink 04t6780731373n13.
• Q5157263 wikiPageExternalLink l10m555830730182.
• Q5157263 wikiPageExternalLink ?p=a62bebfc0dec4164a3a3ba90fefb86aa&pi=10.
• Q5157263 wikiPageWikiLink Q1208485.
• Q5157263 wikiPageWikiLink Q17141220.
• Q5157263 wikiPageWikiLink Q176786.
• Q5157263 wikiPageWikiLink Q236975.
• Q5157263 wikiPageWikiLink Q309157.
• Q5157263 wikiPageWikiLink Q395.
• Q5157263 wikiPageWikiLink Q5563424.
• Q5157263 wikiPageWikiLink Q6045374.
• Q5157263 wikiPageWikiLink Q649732.
• Q5157263 wikiPageWikiLink Q7035970.
• Q5157263 wikiPageWikiLink Q7464734.
• Q5157263 wikiPageWikiLink Q7470275.
• Q5157263 wikiPageWikiLink Q8078.
• Q5157263 wikiPageWikiLink Q818930.
• Q5157263 wikiPageWikiLink Q841728.
• Q5157263 wikiPageWikiLink Q864213.
• Q5157263 type Thing.
• Q5157263 comment "Introduced by Giorgi Japaridze in 2003, computability logic is a research program and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic which is a formal theory of truth. In this approach logical formulas represent computational problems (or, equivalently, computational resources), and their validity means being "always computable".".
• Q5157263 label "Computability logic".
• Q5157263 differentFrom Q5157327.