The following pages link to Linear logic (Q579249):
Displaying 50 items.
- Linear logic as a tool for planning under temporal uncertainty (Q534715) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- Nuclei and conuclei on residuated lattices (Q549349) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
- Polarized and focalized linear and classical proofs (Q556824) (← links)
- Binary quantum logic and generating semigroups (Q584260) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Ternary relations and relevant semantics (Q598309) (← links)
- Interpreting quantum parallelism by sequents (Q616844) (← links)
- Resource modalities in tensor logic (Q636303) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- Cut elimination and strong separation for substructural logics: an algebraic approach (Q636346) (← links)
- A minimal classical sequent calculus free of structural rules (Q636359) (← links)
- Light Dialectica revisited (Q636373) (← links)
- A focused approach to combining logics (Q639671) (← links)
- Grishin algebras and cover systems for classical bilinear logic (Q647406) (← links)
- Contextual deduction theorems (Q647412) (← links)
- A prismoid framework for languages with resources (Q654907) (← links)
- Linearity and iterator types for Gödel's system \(\mathcal T\) (Q656851) (← links)
- Representation theorems for \(Q\)-algebras (Q666689) (← links)
- Forum: A multiple-conclusion specification logic (Q671512) (← links)
- The largest cartesian closed category of stable domains (Q671652) (← links)
- The undecidability of simultaneous rigid E-unification (Q671659) (← links)
- Quasi-prime algebraic domains (Q672133) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- On maximal stable functions (Q673145) (← links)
- Nonsymmetric \(^{\ast}\)-autonomous categories (Q673964) (← links)
- Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) (← links)
- Weakly distributive categories (Q674463) (← links)
- A double deduction system for quantum logic based on natural deduction (Q676184) (← links)
- An alternative linear semantics for allowed logic programs (Q676306) (← links)
- Interpreting quantum logic as a pragmatic structure (Q682630) (← links)
- On the unity of logic (Q685059) (← links)
- Linear logic, coherence and dinaturality (Q685406) (← links)
- A logical view of composition (Q685416) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- Logic and grammar (Q692192) (← links)
- Structure of left-continuous triangular norms with strong induced negations. III: Construction and decomposition (Q698765) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Categorical relationships between Goguen sets and ``two-sided'' categorical models of linear logic (Q705522) (← links)
- Coherent phase spaces. Semiclassical semantics (Q705538) (← links)
- A framework for proof systems (Q707742) (← links)
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- Interaction graphs: multiplicatives (Q714715) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Fine-grained concurrency with separation logic (Q763473) (← links)
