See this document in CiteSeerX!

Denotational Completeness Revisited (1998)  (Make Corrections)  (2 citations)
Thomas Streicher
Electronic Notes in Theoretical Computer Science



  Home/Search   Context   Related

 
View or download:
mathematik.tudarmstadt.de...ctcs.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mathematik.tudarmstadt.de/~st... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We define 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. (Update)

Context of citations to this paper:   More

.... 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...

Cited by:   More
Classical Linear Logic of Implications - Hasegawa (2002)   (Correct)
Categorical Glueing and Logical Predicates for Models of Linear.. - Hasegawa (1999)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Girard Translation and Logical Predicates - Hasegawa (2000)   (Correct)
0.2:   Glueing Algebraic Structures on a 2-Category - Hasegawa (2000)   (Correct)
0.2:   Type-Directed Specialization of Polymorphism - Ohori (1999)   (Correct)

Similar documents based on text:   More   All
0.8:   A Relational Characterisation of Syntactic Definability in.. - Streicher (2001)   (Correct)
0.6:   Full Abstraction and Universality via Realisability - Marz, Rohr, Streicher (1999)   (Correct)
0.5:   Lambda Definability with Sums via Grothendieck Logical Relations - Fiore, Simpson (1999)   (Correct)

Related documents from co-citation:   More   All
2:   Autonomous categories and linear logic (context) - Barr - 1991
2:   What is a categorical model of intuitionistic linear logic - Bierman - 1995
2:   Dual Intuitionistic Linear Logic (context) - Barber - 1995

BibTeX entry:   (Update)

Streicher, T. (1998), Denotational completeness revisited, draft. http://citeseer.ist.psu.edu/streicher98denotational.html   More

@article{ streicher99denotational,
    author = "Thomas Streicher",
    title = "Denotational Completeness Revisited",
    journal = "Electronic Notes in Theoretical Computer Science",
    volume = "29",
    year = "1999",
    url = "citeseer.ist.psu.edu/streicher98denotational.html" }
Citations (may not include all citations):
242   Linear logic (context) - Girard - 1987
66   What is a categorical model of intuitionistic linear logic - Bierman - 1995
26   Categorical reconstruction of a reduction-free normalisation.. - Altenkirch, Hofmann et al. - 1995
20   A new characterization of lambda definability - Jung, Tiuryn - 1993
11   Full Completeness of Models of Linear Logic (context) - Tan - 1997
6   cofree coalgebras and linear logic (context) - Seely, categories - 1989
5   Logical predicates for intuitionistic linear type theories - Hasegawa - 1998
1   to appear in TCS (context) - Girard, completeness - 1995

Documents on the same site (http://www.mathematik.tu-darmstadt.de/~streicher/):   More
Inductive Construction of Repletion - Streicher (1997)   (Correct)
A Relational Characterisation of Syntactic Definability in.. - Streicher (2001)   (Correct)
Classical Logic, Continuation Semantics and Abstract Machines - Streicher, Reus (1998)   (Correct)

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