Bj#rn von Sydow. A machine-assisted proof of the fundamental theorem of arithmetic. PMG Report 68, Chalmers University of Technology, June 1992.  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Martin-Löf's Type Theory - Nordström, Petersson, Smith (Correct)
....a de nition is the user s responsibility. Among the examples developed in ALF, we can mention a proof that Ackermann s function is not primitive recursive [38] functional completeness of combinatorial logic [16] Tait s normalization proof for G#del s T [17] the fundamental theorem of arithmetic [40], a constructive version of Ramsey s theorem [15] and a semantical analysis of simply typed lambda calculus with explicit substitution [7] ....
Bj#rn von Sydow. A machine-assisted proof of the fundamental theorem of arithmetic. PMG Report 68, Chalmers University of Technology, June 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC