Linear logic, totality and full completeness

Ralph Loader

2002 · 45 citations · 4 references

Concepts

Abstract

I give a 'totality space' model for linear logic [4] derived by taking an abstract view of computations on a datatype. The model has similarities with both the coherence space model and game-theoretic models, but is based upon a notion of total object. Using this model, I prove a full completeness result. In other words, I show that the mapping of proofs to their interpretations (here collections of total objects uniform for a given functor) in the model is a surjection.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

4