Electronic Notes in Theoretical Computer Science, Volume 140

Volume 140, 18 November 2005

• Pierre Lescanne, René David, Marek Zaionc:
  Preface. 1
  
• Bartlomiej Bosek, Piotr Micek:
  Variants of Online Chain Partition Problem of Posets. 3-13
  
• Przemyslaw Broniek:
  On-line Chain Partitioning as a Model for Real-time Scheduling. 15-29
  
• Karim Nour, Khelifa Saber:
  A Semantics of Realisability for the Classical Propositional Natural Deduction. 31-39
  
• Marek Zaionc:
  Probabilistic Approach to the Lambda Definability for Fourth Order Types. 41-54
  
• Patrick Thevenon:
  Validation of Proofs Using PhoX. 55-66
  
• Jakub Kozik:
  Conditional Densities of Regular Languages. 67-79
  
• Grzegorz Matecki:
  Asymptotic Density for Equivalence. 81-91
  
• Jean Duprat:
  About Constructive vectors. 93-100
  
• René David, Karim Nour:
  Why the Usual Candidates of Reducibility Do Not Work for the Symmetric lamba-my-calculus. 101-111
  
• Pawel Waszkiewicz:
  Approximation Simply Characterized. 113-117