A Noncommutative Full Completeness Theorem. (Extended Abstract)

Electronic Notes in Theoretical Computer Science

Volumn 3, Issue C, 1996, Pages 28-38

  Blute, R F ^a   Scott, P J ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; LINEAR PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS; SET THEORY; TOPOLOGY; VECTORS;

CLASSICAL LINEAR LOGIC (CLL); COMMUTATIVE LOGIC; DINATURAL TRANSFORMATIONS; HOPF ALGEBRA;

LOGIC PROGRAMMING;

EID: 19144370692     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82517-4     Document Type: Article

References (32)

1. Games and Full Completeness for Multiplicative Linear Logic
2. Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic
3. Functorial Polymorphism
4. Duality of Banach Spaces
5. Bialgebras: Some Foundations for Distributed and Concurrent Computation
6. Linear Logic, Coherence and Dinaturality
7. Hopf Algebras and Linear Logic
8. Linear Läuchli Semantics
9. The Structure of Multiplicatives
10. 50, p.
11. Normal Forms and Cut-free Proofs as Natural Transformations in Logic From Computer Science
12. Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability
13. Introductory Recommendations for the Study of Hopf Algebras in Mathematics and Physics, CWI Quarterly
14. Une Théorie Combinatoire des Séries formelles
15. Hopf Algebras of Combinatorial Structures
16. Projectivity, Injectivity and Duality
17. Quantales and (Noncommutative) Linear Logic
18. Linear Spaces with Mixed Topology