Skip to main content
SpringerLink
Log in

Negative Translations and Duality: Toward a Unified Approach

  • Chapter
Ludics, Dialogue and Interaction

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

  • 456 Accesses

Abstract

We address two related topics concerning recent developments of constructive classical logic. The first topic concerns the well known relationships that negative translation (a.k.a. CPS translation) establishes between classical and intuitionistic logic. We examine why they fail to give us a clear and complete picture of constructive classical logic. Secondly, we analyze some recently developed classical calculi which shed new light on negative translation and its connections with the concept of syntactical duality.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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. Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2(3), 297–347 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. van Atten, M.: The Development of Intuitionistic Logic, The Stanford Encyclopedia of Philosophy (Summer 2009 Edition). Zalta, E.N. (ed.) (2009), ¡ http://plato.stanford.edu/archives/sum2009/entries/intuitionistic-logic-development ¿

  3. Barbanera, F., Berardi, S., Schivalocchi, M.: “Classical” Programming-with-Proofs in λ-sym: An Analysis of Non-Confluence. In: Ito, T., Jayaraman, K. (eds.) TACS 1997. LNCS, vol. 1281, pp. 365–390. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Curien, P.-L., Herbelin, H.: The Duality of Computation. In: Proc. Int. Conf. on Functional Programming. ACM press, New York (2000)

    Google Scholar 

  5. Czermak, J.: A remark on Gentzen’s calculus of sequents. Notre Dame Journal of Formal Logic 18, 471–474 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  6. Danvy, O., Millikin, K., Nielsen, L.R.: On one-pass CPS transformations. J. Funct. Program. 17(6), 793–812 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Danos, V., Joinet, J.-B., e Schellinx, H.: A New Deconstructive Logic: Linear Logic. Journal of Symbolic Logic 62(3), 755–807 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Felleisen, M., Friedman, D., Kohlbecker, E., Duba, B.: Reasoning with Continuations. In: LICS 1986, pp. 131–141 (1986)

    Google Scholar 

  9. Fischer, M.J.: Lambda calculus schemata. In: Proceedings of an ACM Conference on Proving Assertions about Programs, pp. 104–109 (1972)

    Google Scholar 

  10. Friedman, H.: Classically and Intuitionistically Provable Recursive Functions. In: Bird, R.S., Woodcock, J.C.P., Morgan, C.C. (eds.) MPC 1992. LNCS, vol. 669, pp. 21–27. Springer, Heidelberg (1993)

    Google Scholar 

  11. Gentzen, G.: The Collected Papers of Gerhard Gentzen. In: Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam (1969)

    Google Scholar 

  12. Girard, J.-Y.: A New Constructive Logic: Classical Logic. Mathematical Structures in Computer Science 1(3), 255–296 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Glivenko, V.: Sur quelques points de la logique de M. Brouwer. Acadmie Royale de Belgique, Bulletin de la classe des sciences 5(15), 183–188 (1929)

    MATH  Google Scholar 

  14. Gödel, K.: Zur intuitionistischen Arithmetik und Zahlentheorie. Ergebnisse eines mathematischen Kolloquiums 4, 286–295 (1933)

    MATH  Google Scholar 

  15. Griffin, T.: A Formulae-as-Types Notion of Control. In: Principles of Programming Languages, pp. 47–58. ACM Press, New York (1990)

    Google Scholar 

  16. Joinet, J.-B.: Sur la ngation, Manuscript communicated by the author in winter 2009, 20 pages (2009)

    Google Scholar 

  17. Kolmogorov, A.: O principe tertium non datur. Matematiceskij Sbornik 32, 646–667 (1925)

    MATH  Google Scholar 

  18. Krivine, J.-L.: Oprateurs de mise en mmoire et traduction de Gödel. Arch. Math. Logic 30(4), 241–267 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  19. Krivine, J.L.: Classical logic, storage operators and second-order lambda-calculus. Ann. Pure Appl. Logic 68(1), 53–78 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kuroda, S.: Intuitionistische Untersuchungen der formalistischen Logik. Nagoya Math. 3, 35–47 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lafont, Y., Reus, B., Streicher, T.: Continuation Semantics or Expressing Implication by Negation, Technical Report 93-21, University of Munich (1993)

    Google Scholar 

  22. Laurent, O.: Intuitionistic Dual Intuitionistics Nets (2008) (submitted)

    Google Scholar 

  23. Laurent, O., Regnier, L.: About translations of Classical Logic into Polarized Linear Logic. In: Proc. LICS 2003. ACM Press, New York (2003)

    Google Scholar 

  24. Murthy, C.R.: Extracting Constructive Content from Classical Proofs. PhD thesis. Cornell University (1990)

    Google Scholar 

  25. Okada, M.: Some remarks on linear logic. In: van Atten, M., Boldini, P., Bourdeau, M., Heinzmann, G. (eds.) One Hundred Years of Intuitionism. Birkhauser, Basel (2007)

    Google Scholar 

  26. Parigot, M.: λμ-calculus: An Algorithmic Interpretation of Classical Natural Deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 190–201. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  27. Plotkin, G.D.: Call-by-name, Call-by-value and the λ-calculus. Theoretical Computer Science 1, 125–159 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  28. Selinger, P.: Control Categories and Duality: on the Categorical Semantics of the lambda-mu calculus. Mathematical Structures in Computer Science 11, 207–270 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  29. Urban, C., Bierman, G.M.: Strong Normalisation of Cut-Elimination in Classical Logic. Fundamenta Informaticae 20, 1–33 (2001)

    MathSciNet  MATH  Google Scholar 

  30. Urban, C., Ratiu, D.: Classical logic is better than intuitionistic Logic: a conjecture about double negation translations (2008) (submitted)

    Google Scholar 

  31. Zeilberger, N.: On the Unity of Duality. Ann. Pure Appl. Logic 153, 66–96 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SPHERE, Université Paris Diderot - Paris 7, France

    Mattia Petrolo

Authors
  1. Mattia Petrolo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire Structures Formelles du Langage, Université Paris 8, Bat D salle 324, 2 Rue de la Liberté, 93200, Saint Denis, France

    Alain Lecomte

  2. Résurgences/The NetLab.org, 111 Rue Consolat, 12001, Marseille, France

    Samuel Tronçon

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Petrolo, M. (2011). Negative Translations and Duality: Toward a Unified Approach. In: Lecomte, A., Tronçon, S. (eds) Ludics, Dialogue and Interaction. Lecture Notes in Computer Science(), vol 6505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19211-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19211-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19210-4

  • Online ISBN: 978-3-642-19211-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation