Bundy, A (ed.) (1984). CADE-12 , Lecture Notes in Computer Science 814, SpringerVerlag, Berlin. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Autarkic Computations in Formal Proofs - Barendregt, Barendsen (1997) (1 citation) (Correct)
....primitive notions and axioms are introduced) can be verified by computer. Using certain systems of type theory such formalizations obtain a canonical form. The use of computer verified proofs is discussed for example in McCarthy et al. 1962) de Bruijn (1970) de Bruijn (1990) Constable (1986) Bundy (1984), Barendregt (1996) and Cohen (1996) An important question is whether it is feasible to construct fully formalized proofs. Feasibility is meant here in a sense more strict than in computer science: a mathematician should be able to generate correct formal mathematics with an effort comparable to ....
Bundy, A (ed.) (1984). CADE-12 , Lecture Notes in Computer Science 814, SpringerVerlag, Berlin.
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