Logic programming with multiplicative structures
From MaRDI portal
Cites work
- A formal framework for specifying sequent calculus proof systems
- A graphical proof theory of logical time
- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points
- A proof of the focusing theorem via MALL proof nets
- An Analytic Propositional Proof System on Graphs
- Closures and Modules Within Linear Logic Concurrent Constraint Programming
- Combinatorial proofs for constructive modal logic
- Computer Science Logic
- Conflict nets
- Construction of retractile proof structures
- Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing
- Differential interaction nets
- Don't care non-determinism in logic program refinement
- Focussing and proof construction
- From syntactic proofs to combinatorial proofs
- Generalized connectives for multiplicative linear logic
- scientific article; zbMATH DE number 194205 (Why is no real title available?)
- scientific article; zbMATH DE number 1104361 (Why is no real title available?)
- scientific article; zbMATH DE number 1765698 (Why is no real title available?)
- scientific article; zbMATH DE number 2134912 (Why is no real title available?)
- scientific article; zbMATH DE number 2090322 (Why is no real title available?)
- Infinitary cut-elimination via finite approximations
- Information Security and Cryptology - ICISC 2005
- Introduction to algorithms
- Intuitionistic proofs without syntax
- Linear logic
- Logic beyond formulas: a proof system on graphs
- Logic Programming with Focusing Proofs in Linear Logic
- Modularity of proof-nets. Generating the type of a module.
- No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
- Non decomposable connectives of linear logic
- Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
- On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.
- On the meaning of logical rules. II: Multiplicatives and additives
- Proof nets for multiplicative cyclic linear logic and Lambek calculus
- Rewriting modulo symmetric monoidal structure
- Semantics for specialising attack trees based on linear logic
- Sequent systems on undirected graphs
- The structure of multiplicatives
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
- Transcendental syntax I: deterministic case
This page was built for publication: Logic programming with multiplicative structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934058)
