Order:
  1.  47
    Some Uses of Dilators in Combinatorial Problems. II.V. Michele Abrusci, Jean-Yves Girard & Jacques van de Wiele - 1990 - 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 (8 more)  
     
    Export citation  
     
    Bookmark  
  2.  17
    Modèle cohérent des réseaux de preuve.Eric Duquesne & Jacques Van de Wiele - 1994 - Archive for Mathematical Logic 33 (2):131-158.
    No categories
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  3.  12
    Proof Nets of PN as Graphs.Eric Duquesne & Jacques Van de Wiele - 1995 - Archive for Mathematical Logic 34 (1):1-20.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark