2000 character limit reached
Weak topologies for Linear Logic
Published 21 May 2014 in cs.LO | (1405.5393v4)
Abstract: We construct a denotational model of linear logic, whose objects are all the locally convex and separated topological vector spaces endowed with their weak topology. The negation is interpreted as the dual, linear proofs are interpreted as continuous linear functions, and non-linear proofs as sequences of monomials. We do not complete our constructions by a double-orthogonality operation. This yields an interpretation of the polarity of the connectives in terms of topology.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.