René David, Karim Nour Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus. [Citation Graph (0, 0)][DBLP] TLCA, 2005, pp:162-178 [Conf]
Karim Nour, Khelifa Saber A semantical proof of the strong normalization theorem for full propositional classical natural deduction. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2006, v:45, n:3, pp:357-364 [Journal]
René David, Karim Nour Why the Usual Candidates of Reducibility Do Not Work for the Symmetric lamba-my-calculus. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:140, n:, pp:101-111 [Journal]
Karim Nour, Khelifa Saber A Semantics of Realisability for the Classical Propositional Natural Deduction. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:140, n:, pp:31-39 [Journal]
Karim Nour Une réponse négative à la conjecture de E. Tronci pour les systémes numériques typés. [Citation Graph (0, 0)][DBLP] ITA, 1997, v:31, n:6, pp:539-558 [Journal]
Karim Nour A Conjecture on Numeral Systems. [Citation Graph (0, 0)][DBLP] Notre Dame Journal of Formal Logic, 1997, v:38, n:2, pp:270-275 [Journal]
René David, Karim Nour A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:180, n:1-2, pp:371-375 [Journal]
Karim Nour, Christophe Raffalli Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:308, n:1-3, pp:227-237 [Journal]
René David, Karim Nour An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types. [Citation Graph (0, 0)][DBLP] TLCA, 2007, pp:84-101 [Conf]