Describes the use of computer programs to check several proofs in the foundations of mathematics.The lemma G-APPENDN-GCODE shows how G-APPENDN can be expressed in terms of APPEND. ... there is an n such that for any N not smaller than n: (EV 0 ( LIST f-p 0 1) (LIST (GCODE X) (GCODE Y)) (FA) N) (BOOL-FIX (P X Y)). We cananbsp;...

Title | : | Metamathematics, Machines and Gödel's Proof |

Author | : | N. Shankar |

Publisher | : | Cambridge University Press - 1997-01-30 |

Continue