scientific article; zbMATH DE number 6917940
DOI10.23638/LMCS-14(3:6)2018zbMATH Open1447.68005arXiv1805.11988MaRDI QIDQ4580325FDOQ4580325
Publication date: 15 August 2018
Full work available at URL: https://arxiv.org/abs/1805.11988
Title of this publication is not available (Why is that?)
proof theorylogarithmic spacegeometry of interactionpointer machinesimplicit complexityunification algebra
Formal languages and automata (68Q45) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounded linear logic: A modular approach to polynomial-time computability
- A new recursion-theoretic characterization of the polytime functions
- Linear logic and elementary time
- On non-determinacy in simple computing devices
- Elementary complexity and geometry of interaction
- Logarithmic space and permutations
- Nondeterministic Space is Closed under Complementation
- Normativity in Logic
- Geometry of interaction. V: Logic in the hyperfinite factor
- Quasi-interpretations. A way to control resources
- Interaction graphs: additives
- On the sequential nature of unification
- A Machine-Oriented Logic Based on the Resolution Principle
- The method of forced enumeration for nondeterministic automata
- Unification: a multidisciplinary survey
- Unary Resolution: Characterizing Ptime
- Three lightings of logic (Invited Talk)
- A correspondence between maximal abelian sub-algebras and linear logic fragments
- Characterizingco-NLby a group action
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Linear logic by levels and bounded time complexity
- Bounded Linear Logic, Revisited
- Reversible space equals deterministic space
- Logic Programming and Logarithmic Space
- Unification and Logarithmic Space
Cited In (1)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy 👍 👎
- Interaction graphs: graphings 👍 👎
- Logic Programming with Focusing Proofs in Linear Logic 👍 👎
- Unification as a complexity measure for logic programming 👍 👎
- Syntactic unification as a geometric operation in free modules over certain rings 👍 👎
- Logic Programming and Logarithmic Space 👍 👎
- Unification and Logarithmic Space 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580325)
