Skip to main content

Characterizing co-NL by a group action


In a recent paper, Girard (2012) proposed to use his recent construction of a geometry of interaction in the hyperfinite factor (Girard 2011) in an innovative way to characterize complexity classes. We begin by giving a detailed explanation of both the choices and the motivations of Girard's definitions. We then provide a complete proof that the complexity class co-NL can be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete model to compute algorithms.

Hide All
Arora, S. and Barak, B. (2009) Computational Complexity: A Modern Approach volume 1, Cambridge University Press.
Aubert, C. (2011) Sublogarithmic uniform boolean proof nets. In: Marion, J. Y. (ed.) Developements in Implicit Computational Complexity (DICE). Electronic Proceedings in Theoretical Computer Science 75 1527.
Baillot, P. and Pedicini, M. (2001) Elementary complexity and geometry of interaction. Fundamenta Informaticae 45 (1–2) 131.
Conway, J. B. (1990) A Course in Functional Analysis, Springer.
Dal Lago, U. (2005) The geometry of linear higher-order recursion In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society 366–375.
Dal Lago, U. and Hofmann, M. (2010) Bounded linear logic, revisited. Logical Methods in Computer Science 6 (4) 131.
Danos, V. and Joinet, J.-B. (2003) Linear logic & elementary time. Information and Computation 183 (1) 123137.
Girard, J. -Y. (1989a) Geometry of interaction I: Interpretation of system f. Studies in Logic and the Foundations of Mathematics 127 221260.
Girard, J. -Y. (1989b) Towards a geometry of interaction. In: Proceedings of the AMS Conference on Categories, Logic and Computer Science 69–108.
Girard, J. -Y. (2011) Geometry of interaction V: Logic in the hyperfinite factor. Theoretical Computer Science 412 (20) 18601883.
Girard, J. Y. (2012) Normativity in logic In: Dybjer, P., Lindström, S., Palmgren, E. and Sundholm, G. (eds.) Epistemology versus Ontology. Logic, Epistemology, and the Unity of Science, volume 27, Springer 243263.
Haagerup, U. (1975) The standard form of Von Neumann algebras. Mathematica Scandinavia 37 271283.
Hofmann, M., Ramyaa, R. and Schöpp, U. (2013) Pure pointer programs and tree isomorphism. In: Pfenning, F. (ed.) FoSSaCS. Springer Lecture Notes in Computer Science 7794 321336.
Hofmann, M. and Schöpp, U. (2009) Pointer programs and undirected reachability. In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society 133–142.
Immerman, N. (1988) Nondeterministic space is closed under complementation In: Proceedings of the Third Annual Structure in Conference on Computational Complexity (CoCo), IEEE Computer Society 112–115.
Lafont, Y. (2004) Soft linear logic and polynomial time. Theoretical Computer Science 318 (1) 163180.
Murphy, G. J. (1990) C*-Algebras and Operator Theory, Academic Press Inc., Boston, MA.
Rosenberg, A. (1966) On multi-head finite automata. IBM Journal of Research and Development 10 (5) 388394.
Schöpp, U. (2007) Stratified bounded affine logic for logarithmic space. In: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society 411–420.
Seiller, T. (2012a) Interaction graphs: Additives. Arxiv preprint abs/1205.6557.
Seiller, T. (2012b) Interaction graphs: Multiplicatives. Annals of Pure and Applied Logic 163 18081837.
Seiller, T. (2012c) Logique dans le Facteur Hyperfini: Géometrie de l'interaction et Complexité, Ph.D. thesis, Université de la Méditerranée. Available at
Szelepscényi, R. (1987). The method of forcing for nondeterministic automata. Bulletin of the EATCS 33 9699.
Takesaki, M. (2001) Theory of Operator Algebras 1, Encyclopedia of Mathematical Sciences, volume 124, Springer.
Takesaki, M. (2003a) Theory of Operator Algebras 2, Encyclopedia of Mathematical Sciences, volume 125, Springer.
Takesaki, M. (2003b) Theory of Operator Algebras 3, Encyclopedia of Mathematical Sciences, volume 127, Springer.
Terui, K. (2004) Proof nets and boolean circuits. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society 182–191.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed