The following pages link to Linear logic (Q579249):
Displaying 50 items.
- A framework for linear authorization logics (Q2449046) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- The graphical Krivine machine (Q2464713) (← links)
- Type logics and pregroups (Q2467212) (← links)
- Parsing pregroup grammars and Lambek calculus using partial composition (Q2467213) (← links)
- Conditionals and consequences (Q2475433) (← links)
- Maximality and totality of stable functions in the category of stable bifinite domains (Q2475889) (← links)
- System BV is NP-complete (Q2478549) (← links)
- Interface synthesis and protocol conversion (Q2481210) (← links)
- Classical \(F_{\omega}\), orthogonality and symmetric candidates (Q2482840) (← links)
- Call-by-name reduction and cut-elimination in classical logic (Q2482842) (← links)
- On the unity of duality (Q2482843) (← links)
- A stable programming language (Q2492185) (← links)
- Coherence for star-autonomous categories (Q2498908) (← links)
- The three dimensions of proofs (Q2498912) (← links)
- From truth to computability. I. (Q2500484) (← links)
- Geometrical semantics for linear logic (multiplicative fragment) (Q2500490) (← links)
- On structuring proof search for first order linear logic (Q2503319) (← links)
- Orthomodular lattices and quantales (Q2505962) (← links)
- The decidability of the intensional fragment of classical linear logic (Q2517231) (← links)
- When-and how-can a cellular automaton be rewritten as a lattice gas? (Q2518377) (← links)
- Verification of spatial and temporal modalities in biochemical systems (Q2520667) (← links)
- The finite model property for BCI and related systems (Q2563452) (← links)
- Bounded contraction and Gentzen-style formulation of Łukasiewicz logics (Q2563461) (← links)
- Weak linearization of the lambda calculus (Q2566028) (← links)
- Syntax vs. semantics: A polarized approach (Q2570132) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- Subtyping for session types in the pi calculus (Q2576666) (← links)
- Order-enriched categorical models of the classical sequent calculus (Q2576913) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Proof checking and logic programming (Q2628296) (← links)
- A proof theoretic view of spatial and temporal dependencies in biochemical systems (Q2628774) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- Differential logical relations. II: Increments and derivatives (Q2664934) (← links)
- Characterising spectra of equivalences for event structures, logically (Q2672268) (← links)
- Non-normal modal logics and conditional logics: semantic analysis and proof theory (Q2672662) (← links)
- Language models for some extensions of the Lambek calculus (Q2672665) (← links)
- Lattice-theoretic models of conjectures, hypotheses and consequences (Q2676587) (← links)
- Editorial introduction: substructural logics and metainferences (Q2679572) (← links)
- Dialectica principles via Gödel doctrines (Q2682930) (← links)
- The laws of thought and the laws of truth as two sides of one coin (Q2686096) (← links)
- Infinitary action logic with multiplexing (Q2698280) (← links)
- From propositional to linear logic: An introduction. Decoration, simulation, normalization (Q2702566) (← links)
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000 (Q2732529) (← links)
- Free ordered algebraic structures towards proof theory (Q2747705) (← links)
- Computing with Semirings and Weak Rig Groupoids (Q2802473) (← links)
- Call-By-Push-Value from a Linear Logic Point of View (Q2802478) (← links)
- Classical By-Need (Q2802497) (← links)
- Game semantics for access control (Q2805155) (← links)
- Contraction-free proofs and finitary games for linear logic (Q2805162) (← links)
