Studia Logica

, Volume 91, Issue 1, pp 1–24 | Cite as

Many Concepts and Two Logics of Algorithmic Reduction

Article

Abstract

Within the program of finding axiomatizations for various parts of computability logic, it was proven earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting’s intuitionistic calculus. That sort of reduction permits unlimited reusage of the computational resource represented by the antecedent. An at least equally basic and natural sort of algorithmic reduction, however, is the one that does not allow such reusage. The present article shows that turning the logic of the first sort of reduction into the logic of the second sort of reduction takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization. The first (Turing) sort of interactive reduction is also shown to come in three natural versions. While those three versions are very different from each other, their logical behaviors (in isolation) turn out to be indistinguishable, with that common behavior being precisely captured by implicative intuitionistic logic. Among the other contributions of the present article is an informal introduction of a series of new — finite and bounded — versions of recurrence operations and the associated reduction operations.

Keywords

Computability logic Intuitionistic logic Affine logic Linear logic Interactivecomputation Game semantics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abramsky S., Jagadeesan R.: ‘Games and full completeness for multiplicative linear logic’. Journal of Symbolic Logic 59, 543–574 (1994)CrossRefGoogle Scholar
  2. 2.
    Blass A.: ‘Degrees of indeterminacy of games’. Fundamenta Mathematicae 77, 151–166 (1972)Google Scholar
  3. 3.
    Blass A.: ‘A game semantics for linear logic’. Annals of Pure and Applied Logic 56, 183–220 (1992)CrossRefGoogle Scholar
  4. 4.
    Blass, A., ‘Resource consciousness in classical logic’, in G. Mints and R. Muskens (eds.), Games, Logic, and Constructive Sets (Proceedings of LLC9, the 9th conference on Logic, Language, and Computation, held at CSLI), 2003, pp. 61–74.Google Scholar
  5. 5.
    Girard J.Y.: ‘Linear logic’. Theoretical Computer Science 50, 1–102 (1987)CrossRefGoogle Scholar
  6. 6.
    Japaridze G.: ‘Introduction to computability logic’. Annals of Pure and Applied Logic 123, 1–99 (2003)CrossRefGoogle Scholar
  7. 7.
    Japaridze G.: ‘Propositional computability logic I’. ACM Transactions on Computational Logic 7, 302–330 (2006)CrossRefGoogle Scholar
  8. 8.
    Japaridze G.: ‘Propositional computability logic II’. ACM Transactions on Computational Logic 7, 331–362 (2006)CrossRefGoogle Scholar
  9. 9.
    Japaridze G.: ‘From truth to computability I’. Theoretical Computer Science 357, 100–135 (2006)CrossRefGoogle Scholar
  10. 10.
    Japaridze G.: ‘Introduction to cirquent calculus and abstract resource semantics’. Journal of Logic and Computation 16, 489–532 (2006)CrossRefGoogle Scholar
  11. 11.
    Japaridze, G., ‘Computability logic: a formal theory of interaction’, in D. Goldin, S. Smolka and P. Wegner (eds.), Interactive Computation: The New Paradigm, Springer Verlag, 2006, pp. 183–223.Google Scholar
  12. 12.
    Japaridze G.: ‘The logic of interactive Turing reduction’. Journal of Symbolic Logic 72, 243–276 (2007)CrossRefGoogle Scholar
  13. 13.
    Japaridze G.: ‘From truth to computability II’. Theoretical Computer Science 379, 20–52 (2007)CrossRefGoogle Scholar
  14. 14.
    Japaridze G.: ‘Intuitionistic computability logic’. Acta Cybernetica 18, 77–113 (2007)Google Scholar
  15. 15.
    : ‘The intuitionistic fragment of computability logic at the propositional level’. Annals of Pure and Applied Logic 147, 187–227 (2007)CrossRefGoogle Scholar
  16. 16.
    Japaridze G.: ‘Cirquent calculus deepened’. Journal of Logic and Computation 18, 983–1028 (2008)CrossRefGoogle Scholar
  17. 17.
    Japaridze G.: ‘Sequential operators in computability logic’. Information and Computation 206, 1443–1475 (2008)CrossRefGoogle Scholar
  18. 18.
    Japaridze, G., ‘In the beginning was game semantics’, in O. Majer, A.-V. Pietarinen and T. Tulenheimo (eds.), Games: Unifying Logic, Language and Philosophy, Springer Verlag, 2009, pp. 249–250.Google Scholar
  19. 19.
    Japaridze, G., ‘Towards applied theories based on computability logic’, Preprint is available at http://arxiv.org/abs/0805.3521
  20. 20.
    Vereshchagin, N., ‘Japaridze’s computability logic and intuitionistic propositional calculus’, Moscow State University preprint (Russian), 2006. Available at http://lpcs.math.msu.su/?ver/papers/japaridze.ps

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Institute of Artificial IntelligenceXiamen UniversityXiamenChina
  2. 2.Department of Computing SciencesVillanova UniversityVillanovaUSA

Personalised recommendations