The following pages link to Linear logic (Q579249):
Displaying 50 items.
- Logical semantics for stability (Q2805169) (← links)
- Game Semantics for Bounded Polymorphism (Q2811332) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- Characterization of projective quantales (Q2811986) (← links)
- Conuclear images of substructural logics (Q2813674) (← links)
- A Curry–Howard View of Basic Justification Logic (Q2820702) (← links)
- Relating toy models of quantum computation: comprehension, complementarity and dagger mix autonomous categories (Q2825368) (← links)
- Scalar System F for linear-algebraic \(\lambda\)-calculus: towards a quantum physical logic (Q2825375) (← links)
- Enforcing Availability in Failure-Aware Communicating Systems (Q2827467) (← links)
- Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing (Q2835043) (← links)
- Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
- Information Flow Under Budget Constraints (Q2835882) (← links)
- An implementation model of the typed \(\lambda\)-calculus based on linear chemical abstract machine (Q2841304) (← links)
- Non-uniform hypercoherences (Q2842815) (← links)
- Multiplicative linear logics and fibrations (Q2842824) (← links)
- Processes and games (Q2851048) (← links)
- Event domains, stable functions and proof-nets (Q2864146) (← links)
- Conformal field theory as a nuclear functor (Q2864148) (← links)
- Definability and full abstraction (Q2864154) (← links)
- A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine (Q2864217) (← links)
- A calculus for interaction nets based on the linear chemical abstract machine (Q2864502) (← links)
- Soft linear logic and polynomial complexity classes (Q2866738) (← links)
- The power of closed reduction strategies (Q2866800) (← links)
- A graph abstract machine describing event structure composition (Q2867884) (← links)
- Hybridizing a logical framework (Q2867954) (← links)
- Universal Boolean systems (Q2870310) (← links)
- Deduction graphs with universal quantification (Q2870317) (← links)
- Rewritings for polarized multiplicative and exponential proof structures (Q2870318) (← links)
- Specifying properties of concurrent computations in CLF (Q2871839) (← links)
- A meta linear logical framework (Q2871843) (← links)
- Token-passing nets for functional languages (Q2873684) (← links)
- Propositions as sessions (Q2875234) (← links)
- Note on deduction theorems in contraction-free logics (Q2888635) (← links)
- A coding theoretic study of MLL proof nets (Q2888855) (← links)
- Strong Equivalence of RASP Programs (Q2900516) (← links)
- Which Logic for the Radical Anti-realist? (Q2908756) (← links)
- Stable Philosophical Systems and Radical Anti-realism (Q2908771) (← links)
- A quantum double construction in Rel. (Q2909732) (← links)
- Strong negation in intuitionistic style sequent systems for residuated lattices (Q2922496) (← links)
- A Linear Logic Programming Language for Concurrent Programming over Graph Structures (Q2931260) (← links)
- A Proof Theoretic Study of Soft Concurrent Constraint Programming (Q2931271) (← links)
- The Relevance of Relevance to Relevance Logic (Q2937386) (← links)
- UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICS (Q2940884) (← links)
- Foundations for Reliable and Flexible Interactive Multimedia Scores (Q2942295) (← links)
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems (Q2944903) (← links)
- Debits and Credits in Petri Nets and Linear Logic (Q2945703) (← links)
- Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing (Q2947459) (← links)
- Proof-Theoretic Aspects of the Lambek-Grishin Calculus (Q2947464) (← links)
- An Epistemic Separation Logic (Q2947467) (← links)
- On Classical Nonassociative Lambek Calculus (Q2963995) (← links)
