Characterizingco-NLby a group action

DOI10.1017/S0960129514000267zbMath1362.68084arXiv1209.3422OpenAlexW2044971924MaRDI QIDQ5741572

Clément Aubert, Thomas Seiller

Publication date: 28 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.3422

zbMATH Keywords

geometry of interactioncoNLnondeterministic pointer machine

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (7)

Interaction graphs: graphings ⋮ Interaction graphs: additives ⋮ A correspondence between maximal abelian sub-algebras and linear logic fragments ⋮ Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach ⋮ Unnamed Item ⋮ Rule-Following and the Limits of Formalization: Wittgenstein’s Considerations Through the Lens of Logic ⋮ Unary Resolution: Characterizing Ptime

Cites Work

• Unnamed Item
• Geometry of interaction. V: Logic in the hyperfinite factor
• Interaction graphs: multiplicatives
• Linear logic and elementary time
• Soft linear logic and polynomial time
• The standard form of von Neumann algebras.
• Pure Pointer Programs and Tree Isomorphism
• Normativity in Logic
• Computational Complexity
• On Multi-Head Finite Automata

This page was built for publication: Characterizingco-NLby a group action