Skip to main content
SpringerLink
Log in

On Game Semantics of the Affine and Intuitionistic Logics

(Extended Abstract)

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5110))

Abstract

We show that the uniform validity is equivalent to the non-uniform validity for both Blass’ semantics of [1] and Japaridze’s semantics of [5] (thus proving a conjecture from [5]). We present a shorter proof (than that of [10]) of the completeness of the positive fragment of intuitionistic logic for both these semantics. Finally, we show that validity for the “parallel recurrence” version of Japaridze’s semantics of [5] is equivalent to accomplishability in the sense of [4].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blass, A.: A game semantics for linear logic. Annals of Pure and Applied Logic 56, 183–220 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chernov, A.V., Skvortsov, D.P., Skvortsova, E.Z., Vereshchagin, N.K.: Variants of Realisability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 74–88. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Girard, G.Y.: Linear logic. Theoretical Computer Science 50(1), 1–102 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Japaridze, G.: The logic of tasks. Annals of Pure and Applied Logic 117, 263–295 (2002)

    Article  MathSciNet  Google Scholar 

  5. Japaridze, G.: Introduction to computability logic. Annals of Pure and Applied Logic 123, 1–99 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Japaridze, G.: In the beginning was game semantics, arXiv:cs.LO/0507045, 111 pages (2005)

    Google Scholar 

  7. Japaridze, G.: A letter to N.V. (04.11.2005)

    Google Scholar 

  8. Japaridze, G.: Introduction to Cirquent Calculus and Abstract Resource Semantics. Journal of Logic and Computation 16(4), 489–532 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Japaridze, G.: Intuitionistic computability logic. Acta Cybernetica 18(1), 77–113 (2007)

    MATH  MathSciNet  Google Scholar 

  10. Japaridze, G.: The intuitionistic fragment of computability logic at the propositional level. Annals of Pure and Applied Logic 147(3), 187–227 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Medvedev, Y.T.: Finite problems. Doklady Akad. Nauk SSSR 3, 227–230 (1962)

    MATH  Google Scholar 

  12. Rose, G.F.: Propositional calculus and realizability. Transactions of the American Mathematical Society 75(1), 1–19 (1953)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The German Research Center for Artificial Intelligence, TU Kaiserslautern,  

    Ilya Mezhirov

  2. Lomonosov Moscow State University, Leninskie Gory, Moscow, 119991,  

    Nikolay Vereshchagin

Authors
  1. Ilya Mezhirov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikolay Vereshchagin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfrid Hodges Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mezhirov, I., Vereshchagin, N. (2008). On Game Semantics of the Affine and Intuitionistic Logics. In: Hodges, W., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2008. Lecture Notes in Computer Science(), vol 5110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69937-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69937-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69936-1

  • Online ISBN: 978-3-540-69937-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation