The following pages link to Linear logic (Q579249):
Displaying 50 items.
- Phase semantics for a pure noncommutative linear propositional logic (Q1288431) (← links)
- Chu spaces from the representational viewpoint (Q1295426) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- Sentential constants in systems near R (Q1313086) (← links)
- Resolution calculus for the first order linear logic (Q1314284) (← links)
- Modal logic as metalogic (Q1314285) (← links)
- Finite games for a predicate logic without contractions (Q1314388) (← links)
- Defining concurrent processes constructively (Q1314421) (← links)
- The finite model property for BCK and BCIW (Q1317904) (← links)
- An internal language for autonomous categories (Q1320337) (← links)
- An equivalence between lambda- terms (Q1322165) (← links)
- Informational interpretation of substructural propositional logics (Q1322438) (← links)
- Coherent models of proof nets (Q1325054) (← links)
- Linear logic with fixed resources (Q1326773) (← links)
- Linear logic as a logic of computations (Q1326780) (← links)
- Distributed programming with logic tuple spaces (Q1329178) (← links)
- Quantum logic and linear logic (Q1330093) (← links)
- Homology of proof-nets (Q1330310) (← links)
- The conjoinability relation in Lambek calculus and linear logic (Q1334986) (← links)
- Semantics of weakening and contraction (Q1337357) (← links)
- Modalities in linear logic weaker than the exponential ``of course'': Algebraic and relational semantics (Q1337609) (← links)
- The complexity of Horn fragments of linear logic (Q1337693) (← links)
- Proof strategies in linear logic (Q1340963) (← links)
- Proofs as processes (Q1342245) (← links)
- On the \(\pi\)-calculus and linear logic (Q1342247) (← links)
- On proof normalization in linear logic (Q1342248) (← links)
- Head linear reduction and pure proof net extraction (Q1342250) (← links)
- First-order linear logic without modalities is NEXPTIME-hard (Q1342252) (← links)
- Constant-only multiplicative linear logic is NP-complete (Q1342254) (← links)
- Limited reasoning in first-order knowledge bases (Q1343837) (← links)
- Reflections on ``difficult'' embeddings (Q1344853) (← links)
- Meeting strength in substructural logics (Q1344870) (← links)
- \(*\)-autonomous categories of bimodules (Q1345016) (← links)
- On the linear decoration of intuitionistic derivations (Q1345901) (← links)
- Continuity of left-continuous triangular norms with strong induced negations and their boundary condition (Q1349172) (← links)
- Monoidal t-norm based logic: Towards a logic for left-continuous t-norms (Q1349199) (← links)
- Semantic data modelling using linear logic (Q1349996) (← links)
- Hypersequents, logical consequence and intermediate logics for concurrency (Q1354077) (← links)
- Completeness results for linear logic on Petri nets (Q1361243) (← links)
- A constructive game semantics for the language of linear logic (Q1361252) (← links)
- Interaction nets and term-rewriting systems (Q1389438) (← links)
- New Curry-Howard terms for full linear logic (Q1390952) (← links)
- May I borrow your logic? (Transporting logical structures along maps) (Q1391728) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- Exhausting strategies, joker games and full completeness for IMLL with unit (Q1398468) (← links)
- Coherence for sharing proof-nets (Q1398472) (← links)
- Encoding transition systems in sequent calculus (Q1398474) (← links)
- Chu spaces as a semantic bridge between linear logic and mathematics. (Q1398475) (← links)
- Handsome proof-nets: Perfect matchings and cographs (Q1398476) (← links)
- Phase semantics for light linear logic (Q1398478) (← links)
