Computational interpretations of classical linear logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4576 LNCS, Issue , 2007, Pages 285-296

  Oliva, Paulo ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GAME THEORY;

COMPUTATIONAL INTERPRETATIONS; INTUITIONISTIC LOGIC; LINEAR LOGIC; REALIZABILITY;

FORMAL LOGIC;

EID: 38149017741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73445-1_20     Document Type: Conference Paper

References (21)

1. Avigad, J., Feferman, S.: Gödel's functional ("Dialectica" ) interpretation. In: Avigad, J., Feferman, S. (eds.) Handbook of proof theory. Studies in Logic and the Foundations of Mathematics, vol. 137, pp. 337-405. North Holland, Amsterdam (1998)
2. Bezem, M.: Strongly majorizable functionals of finite type: a model for bar recursion containing discontinuous functionals. The Journal of Symbolic Logic 50, 652-660 (1985)
3. Blass, A.: Questions and answers - a category arising in linear logic, complexity theory, and set theory. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Math. Soc. Lecture Notes, vol. 222, pp. 61-81 (1995)
4. Blass, A., Gurevich, Y.: Henkin quantifiers and complete problems. Annals of Pure and Applied Logic 32, 1-16 (1986)
5. Bradfield, J.: Independence: Logic and concurrency. In: Proceedings of Computer Science Logic (2000)
6. Diller, J., Nahm, W.: Eine Variant zur Dialectica-interpretation der Heyting Arithmetik endlicher Typen. Arch. Math. Logik Grundlagenforsch 16, 49-66 (1974)
7. Ferreira, F., Oliva, P.: Bounded functional interpretation. Annals of Pure and Applied Logic 135, 73-112 (2005)
8. Ferreira, F., Oliva, P.: Bounded functional interpretation in feasible analysis. Annals of Pure and Applied Logic 145, 115-129 (2007)
9. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50(1), 1-102 (1987)
10. Girard, J.-Y.: Towards a geomery of interaction. Contemporary Mathematics, 92 (1989)
11. Gödel, K.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12, 280-287 (1958)
12. Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic methods, pp. 167-183. Pergamon Press, New York, and Polish Scientific Publishers, Warsaw (1961)
13. Hyland, J.M.E.: Proof theory in the abstract. Annals of Pure and Applied Logic 114, 43-78 (2002)
14. Kreisel, G.: Interpretation of analysis by means of constructive functionals of finite types. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 101-128. North Holland, Amsterdam (1959)
15. Oliva, P.: Unifying functional interpretations. Notre Dame Journal of Formal Logic 47(2), 263-290 (2006)
16. Oliva, P.: Modified realizability interpretation of classical linear logic. In: Proc. of the Eighteenth Annual IEEE Symposium on Logic in Computer Science LICS'07, IEEE Computer Society Press, Los Alamitos (2007)
17. de Paiva, V.C.V.: A Dialectica-like model of linear logic. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poigné, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 341-356. Springer, Heidelberg (1989)
18. Shirahata, M.: The Dialectica interpretation of first-order classical linear logic. Theory and Applications of Categories 17(4), 49-79 (2006)
19. Stein, M.: Interpretationen der Heyting-Arithmetik endlicher Typen. Arch. Math. Logik Grundlag 19, 175-189 (1979)
20. Troelstra, A.S.: Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics, vol. 344. Springer, Heidelberg (1973)
21. Troelstra, A.S.: Realizability. Handbook of proof theory 137, 408-473 (1998)