The following pages link to Linear logic (Q579249):
Displaying 50 items.
- Conflict vs causality in event structures (Q1996864) (← links)
- Completeness of second-order intuitionistic propositional logic with respect to phase semantics for proof-terms (Q2000674) (← links)
- Fuzzy sets and formal logics (Q2014418) (← links)
- A categorical construction for the computational definition of vector spaces (Q2024925) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- The bang calculus revisited (Q2039931) (← links)
- A comparative study of ideals in fuzzy orders (Q2041246) (← links)
- Transactions and contracts based on reaction systems (Q2044946) (← links)
- On sheaf cohomology and natural expansions (Q2054954) (← links)
- Complexity of Lambek calculi with modalities and of total derivability in grammars (Q2066100) (← links)
- Infinitary action logic with exponentiation (Q2067638) (← links)
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems (Q2095424) (← links)
- Soft subexponentials and multiplexing (Q2096472) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- Prioritise the best variation (Q2117016) (← links)
- Defining formal explanation in classical logic by substructural derivability (Q2117787) (← links)
- Frobenius quantales, Serre quantales and the Riemann-Roch theorem (Q2118970) (← links)
- Resourceful program synthesis from graded linear types (Q2119110) (← links)
- A formal model for a linear time correctness condition of proof nets of multiplicative linear logic (Q2119124) (← links)
- Session-based concurrency, declaratively (Q2120811) (← links)
- Logic and majority voting (Q2121481) (← links)
- Bifibrations of polycategories and classical linear logic (Q2133466) (← links)
- Finiteness spaces and generalized power series (Q2134813) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- Logical foundations for hybrid type-logical grammars (Q2135950) (← links)
- Communicating finite state machines and an extensible toolchain for multiparty session types (Q2140476) (← links)
- Plotkin's call-by-value \(\lambda\)-calculus as a modal calculus (Q2141293) (← links)
- Basing sequent systems on exclusive-or (Q2142068) (← links)
- Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs (Q2142085) (← links)
- Semantics of quantum programming languages: Classical control, quantum control (Q2168785) (← links)
- Coproduct and amalgamation of deductive systems by means of ordered algebras (Q2169140) (← links)
- The explosion calculus (Q2186694) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- Proofs and surfaces (Q2195640) (← links)
- A categorical model of predicate linear logic (Q2201096) (← links)
- Linear logic in computer science (Q2201109) (← links)
- From QBFs to \textsf{MALL} and back via focussing (Q2209553) (← links)
- A restricted fragment of the Lambek calculus with iteration and intersection operations (Q2213927) (← links)
- Paraconsistency in classical logic (Q2219139) (← links)
- A fresh view of linear logic as a logical framework (Q2229156) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- Generalized bounded linear logic and its categorical semantics (Q2233407) (← links)
- Focused proof-search in the logic of bunched implications (Q2233409) (← links)
- Adjoint reactive GUI programming (Q2233414) (← links)
- The spirit of node replication (Q2233421) (← links)
- Graded modal dependent type theory (Q2233475) (← links)
- Bayesian strategies: probabilistic programs as generalised graphical models (Q2233478) (← links)
- Natural deduction bottom up (Q2236507) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
