The following pages link to Linear logic (Q579249):
Displaying 50 items.
- Possible worlds and resources: The semantics of \(\mathbf{BI}\) (Q1826634) (← links)
- \(U\)-Sets as a possibilistic set theory (Q1827315) (← links)
- Stratified coherence spaces: A denotational semantics for light linear logic (Q1827389) (← links)
- Soft linear logic and polynomial time (Q1827397) (← links)
- Focussing and proof construction (Q1840461) (← links)
- The logic of tasks (Q1849860) (← links)
- Streams and strings in formal proofs. (Q1853510) (← links)
- Structural cut elimination. I: Intuitionistic and classical logic (Q1854335) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Decidability of linear affine logic (Q1854403) (← links)
- Encoding linear logic with interaction combinators (Q1854547) (← links)
- The propositional logic of elementary tasks (Q1861137) (← links)
- The additive multiboxes (Q1861326) (← links)
- Projective and injective objects in the category of quantales (Q1861462) (← links)
- Comparing hierarchies of types in models of linear logic (Q1881220) (← links)
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- Softness of MALL proof-structures and a correctness criterion with Mix (Q1882627) (← links)
- The differential lambda-calculus (Q1884894) (← links)
- MELL in the calculus of structures (Q1884903) (← links)
- Polarized games (Q1886321) (← links)
- Natural deduction for intuitionistic linear logic (Q1891252) (← links)
- Sequent reconstruction in LLM -- A sweepline proof (Q1892938) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- Asynchronous communication model based on linear logic (Q1898813) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- On \(\text{NP}\)-completeness in linear logic (Q1899149) (← links)
- Some lattice models of bilinear logic (Q1906000) (← links)
- Relations and non-commutative linear logic (Q1910723) (← links)
- Linear Läuchli semantics (Q1919529) (← links)
- Linear logic for nets with bounded resources (Q1919758) (← links)
- Linear logic automata (Q1919766) (← links)
- A linear conservative extension of Zermelo-Fraenkel set theory (Q1919983) (← links)
- Extending Lambek grammars to basic categorial grammars (Q1923836) (← links)
- Fibred semantics for feature-based grammar logic (Q1923842) (← links)
- Free algebras corresponding to multiplicative classical linear logic and some of its extensions (Q1924328) (← links)
- Categorical shape theory as a formal language for pattern recognition? (Q1924765) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- A category equivalence for odd Sugihara monoids and its applications (Q1934971) (← links)
- The taming of recurrences in computability logic through cirquent calculus. I (Q1935369) (← links)
- Simple free star-autonomous categories and full coherence (Q1936110) (← links)
- An algebraic correctness criterion for intuitionistic multiplicative proof-nets (Q1960420) (← links)
- From multiple sequent for additive linear logic to decision procedures for free lattices (Q1960422) (← links)
- Variations on mobile processes (Q1960530) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- The name discipline of uniform receptiveness (Q1960533) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- On phase semantics and denotational semantics in multiplicative-additive linear logic (Q1971797) (← links)
- Proof nets for classical logic (Q1982017) (← links)
- Structural weakening and paradoxes (Q1982021) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
