| Streicher, T. (1999) Denotational completeness revisited. In [14]. |
.... to combine our approach to other techniques of specifying properties of semantic categories, for instance that of specification structures [1] We also note that an application of parameterized logical predicates for models of full propositional classical linear logic is found in Streicher s work [41] (see Example 3.9) Some of the results in this paper have appeared in a preliminary version [23] where only the cases of intuitionistic linear type theories are discussed. Construction of This Paper In Section 2 we review some basic concepts of symmetric monoidal categories and related ....
....to 1. The subglueing (Set C op 0 # G) s will appear in Section 4.1 as the category C 0 PRED of the parameterized predicates. ut Example 3. 9 (Proof relavant phase semantics) The following construction appears in Streicher s work on denotationally complete models of classical linear logic [41]. In example 3.8, suppose that the category C 1 is autonomous. The resulting subglueing need not be autonomous; however, it is easily seen that, for any subfunctor P of C 1 (I( the canonical natural transformation from ( P) to ( P) P) P) is anisomorphism. ....
[Article contains additional citation context not shown here]
Streicher, T. (1998), Denotational completeness revisited, draft.
No context found.
Streicher, T. (1999) Denotational completeness revisited. In [14].
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC