Giorgi Japaridze

Giorgi Japaridze

Giorgi Japaridze is a logician, at Villanova University in Villanova, Pennsylvania. In the past his contributions were primarily into the areas of provability logic and interpretability logic. Currently he is best known for his work on computability logic (CL).

Technically CL is a game logic: it understands interactive computational problems as games played by a machine against the environment, their computability as existence of a machine that always wins the game, logical operators as operations on computational problems, and validity of a logical formula as being a scheme of "always computable" problems.

Classical logic, intuitionistic logic, and linear logic (in a broad sense), turn out to be three natural fragments of CL.The classical concept of truth is a special case of computability, -- computability restricted to problems of zero interactivity degree. Correspondingly, classical logic is a special fragment of CL. One of the main intuitions associated with intuitionistic logic is that it must be a logic of problems (Kolmogorov 1932); this is exactly what CL is, but in a more expressive language than intuitionistic logic. And one of the main claims of linear logic is that it is a logic of resources. Reversing of the roles of the machine and its environment turns computational problems into computational resources, which makes CL a logic of resources, only, again, in a more expressive language than that of linear logic, and based on an intuitively convincing and mathematically strict resource semantics.

References

*G. Japaridze, "Introduction to computability logic". Annals of Pure and Applied Logic 123 (2003), pages 1-99.
*G.Japaridze and D.DeJongh, "The logic of provability". In: Handbook of Proof Theory, S.Buss, ed., North-Holland, 1998, pages 475-545.
*L.D. Beklemishev, J.J. Joosten and M. Vervoort, "A finitary treatment of the closed fragment of Japaridze's provability logic". Journal of Logic and Computation 15(4) (2005), pages 447-463.
*G. Boolos, "The analytical completeness of Japaridze's polymodal logics". Annals of Pure and Applied Logic 61 (1993), pages 95-111.

External links

* [http://www.csc.villanova.edu/~japaridz Giorgi Japaridze's Homepage]
* [http://www.cis.upenn.edu/~giorgi/cl.html Computability Logic Homepage]
* [http://www.csc.villanova.edu/~japaridz/CL/gsoll.html Game Semantics or Linear Logic?]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Japaridze — ( ka. ჯაფარიძე) may mean:*Japaridze, a noble family in Georgia*Giorgi Japaridze, a modern Georgian logician *Otar Japaridze (b. 1987), a Georgian ice dancer *Revaz Japaridze (b. 1923), a Georgian writer *Prokopius Dzhaparidze (1880 1918), a… …   Wikipedia

  • Computability logic — Introduced by Giorgi Japaridze in 2003, computability logic is a research programme 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 …   Wikipedia

  • Logics for computability — are formulations of logic whichcapture some aspect of computability as a basic notion. This usually involves a mixof special logical connectives as well as semantics which explains how the logic is to be interpreted in a computational… …   Wikipedia

  • Weak interpretability — is a special case of the concept of tolerance introduced by Giorgi Japaridze in 1992. Assume T and S are formal theories. Slightly simplified, T is said to be weakly interpretable in S if, and only if, the language of T can be translated into the …   Wikipedia

  • Interpretability logic — Interpretability logics comprise a family of modal logics that extend provability logic to describe interpretability and/or various related metamathematical properties and relations such as weak interpretability, Pi;1 conservativity,… …   Wikipedia

  • Provability logic — is a modal logic, in which the box (or necessity ) operator is interpreted as it is provable that . The point is to capture the notion of a proof predicate of a reasonably rich formal theory, such as Peano arithmetic. There are a number of… …   Wikipedia

  • Lógica demostrativa — La lógica demostrativa es una lógica modal, en la que el operador caja (o necesidad ) es interpretado significando debe ser demostrado que . El aspecto que se desea capturar es la noción de un predicado de demostración de una teoría formal… …   Wikipedia Español

  • Interpretability — The concept of interpretability is one in mathematical logic. Assume T and S are formal theories. Slightly simplified, T is said to be interpretable in S iff the language of T can be translated into the language of S in such a way that S proves… …   Wikipedia

  • List of logicians — A logician is a person, such as a philosopher or mathematician, whose topic of scholarly study is logic. The famous logicians are listed below in English alphabetical transliteration order (by surname).compactTOC NOTOC A * Nate Ackerman (USA,… …   Wikipedia

  • Kura-Araxes-Kultur — Die Kura Araxes Kultur (auch frühtranskaukausische Kultur oder Mtkwari Araxes Kultur[1]) ist eine frühbronzezeitliche Kultur im Kaukasus. Inhaltsverzeichnis 1 Forschungsgeschichte 2 Verbreitung 3 Chronologie …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”