Denotational Completeness Revisited

@article{Streicher1999DenotationalCR,
  title={Denotational Completeness Revisited},
  author={Thomas Streicher},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={1999},
  volume={29},
  pages={288-300}
}
We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.