Multiplexor categories and models of soft linear logic
This thesis furthers our semantical understanding of polynomial time complexity by clarifying the semantical status of Lafont's soft linear logic, a logical system complete for polynomial time computation. We shall see that soft linear logic is ideal for this purpose because it possesses a very...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Ottawa (Canada)
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/29528 http://dx.doi.org/10.20381/ruor-19794 |