Author of the publication

Introduction à la logique : théorie de la démonstration ; cours et exercices corrigés

, , and . Dunod, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An experiment concerning mathematical proofs on computers with French undergraduate students., and . J. Appl. Log., 2 (2): 219-239 (2004)Introduction à la logique : théorie de la démonstration ; cours et exercices corrigés, , and . Dunod, (2004)Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic., and . Theor. Comput. Sci., 308 (1-3): 227-237 (2003)PhoX., and . The Seventeen Provers of the World, volume 3600 of Lecture Notes in Computer Science, Springer, (2006)Getting results from programs extracted from classical proofs.. Theor. Comput. Sci., 323 (1-3): 49-70 (2004)System ST \beta-reduction and completeness.. LICS, page 21-. IEEE Computer Society, (2003)Practical Subtyping for Curry-Style Languages., and . ACM Trans. Program. Lang. Syst., 41 (1): 5:1-5:58 (2019)Data Types, Infinity and Equality in System AF2.. CSL, volume 832 of Lecture Notes in Computer Science, page 280-294. Springer, (1993)Completeness, minimal logic and programs extraction.. Theor. Comput. Sci., 254 (1-2): 259-271 (2001)A Semantical Storage Operator Theorem for All Types.. Ann. Pure Appl. Log., 91 (1): 17-31 (1998)