1. Eric Duquesne & Jacques Van de Wiele (1995). Proof Nets of PN as Graphs. Archive for Mathematical Logic 34 (1):1-20.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  2. Eric Duquesne & Jacques Van de Wiele (1994). Modèle cohérent des réseaux de preuve. Archive for Mathematical Logic 33 (2):131-158.
    No categories
    Translate to English
    | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. V. Michele Abrusci, Jean-Yves Girard & Jacques Van De Wiele (1990). Some Uses of Dilators in Combinatorial Problems. II. Journal of Symbolic Logic 55 (1):32-40.
    We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation