10 citations · 24 across the 13 of their papers we have counts for
13 papers
About the range property for H
René David, Karim Nour
Recently, A. Polonsky has shown that the range property fails for H. We give here some conditions on a closed term that imply that its range has an infinite cardinality.
A short proof that adding some permutation rules to preserves
Rene David
I show that, if a term is for , it remains when some permutation rules are added.
Strong normalization results by translation
René David, Karim Nour
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed…
Counting proofs in propositional logic
René David, Marek Zaionc
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula…
A direct proof of the confluence of combinatory strong reduction
René David
I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for…
A short proof of the strong normalization of the simply typed -calculus
René David, Karim Nour
We give an elementary and purely arithmetical proof of the strong normalization of Parigot's simply typed -calculus.