scientific article; zbMATH DE number 6917940
From MaRDI portal
Publication:4580325
DOI10.23638/LMCS-14(3:6)2018zbMath1447.68005arXiv1805.11988MaRDI QIDQ4580325
Publication date: 15 August 2018
Full work available at URL: https://arxiv.org/abs/1805.11988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
proof theorylogarithmic spacegeometry of interactionpointer machinesimplicit complexityunification algebra
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logarithmic space and permutations
- Geometry of interaction. V: Logic in the hyperfinite factor
- Quasi-interpretations. A way to control resources
- Interaction graphs: additives
- Linear logic by levels and bounded time complexity
- The method of forced enumeration for nondeterministic automata
- Bounded linear logic: A modular approach to polynomial-time computability
- A new recursion-theoretic characterization of the polytime functions
- Linear logic and elementary time
- Reversible space equals deterministic space
- On non-determinacy in simple computing devices
- Logic Programming and Logarithmic Space
- Unary Resolution: Characterizing Ptime
- Three lightings of logic (Invited Talk)
- On the sequential nature of unification
- Nondeterministic Space is Closed under Complementation
- Unification: a multidisciplinary survey
- A correspondence between maximal abelian sub-algebras and linear logic fragments
- Unification and Logarithmic Space
- Normativity in Logic
- A Machine-Oriented Logic Based on the Resolution Principle
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Characterizingco-NLby a group action
- Bounded Linear Logic, Revisited
This page was built for publication:
