Results 1 
8 of
8
The Matita Interactive Theorem Prover
"... Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at
Some considerations on the usability of Interactive Provers
"... Abstract. In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the “second generation ” of systems, in the mid of the eighties. We try to ana ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the “second generation ” of systems, in the mid of the eighties. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions. 1
A BIDIRECTIONAL REFINEMENT ALGORITHM FOR THE CALCULUS OF (CO)INDUCTIVE CONSTRUCTIONS
"... address: ..."
Social Processes, Program Verification and All That
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2009
"... ... mostly motivating their position by an analogy with proofs in mathematics, and in particular with the impracticality of a strictly formalist approach to this discipline. The recent, impressive achievements in the field of interactive theorem proving provide an interesting ground for a critical r ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
... mostly motivating their position by an analogy with proofs in mathematics, and in particular with the impracticality of a strictly formalist approach to this discipline. The recent, impressive achievements in the field of interactive theorem proving provide an interesting ground for a critical revisiting of those theses. We believe that the social nature of proof and program development is uncontroversial and ineluctable but formal verification is not antithetical to it. Formal verification should strive not only to cope, but to ease and enhance the collaborative, organic nature of this process, eventually helping to master the growing complexity of scientific knowledge.
Contents
"... We present a formalisation of a constructive proof of Lebesgue’s Dominated Convergence Theorem given by Sacerdoti Coen and Zoli in [SZ]. The proof is done in the abstract setting of ordered uniformities, also introduced by the two authors as a simplification of Weber’s lattice uniformities given in ..."
Abstract
 Add to MetaCart
We present a formalisation of a constructive proof of Lebesgue’s Dominated Convergence Theorem given by Sacerdoti Coen and Zoli in [SZ]. The proof is done in the abstract setting of ordered uniformities, also introduced by the two authors as a simplification of Weber’s lattice uniformities given in [Web91, Web93]. The proof is fully constructive, in the sense that it is done in Bishop’s style and, under certain assumptions, it is also fully predicative. The formalisation is done in the Calculus of (Co)Inductive Constructions using the interactive theorem prover Matita [ASTZ07]. It exploits some peculiar features of Matita and an advanced technique to represent algebraic hierarchies previously introduced by the authors in [ST07]. Moreover, we introduce a new technique to cope with duality to halve the formalisation effort. Both authors were supported by DAMA (Dimostrazione Assistita per la Matematica e
Notes at Conferences on Intelligent Computer Mathematics 2010
, 2010
"... If you read nothing else, read footnote 1 on page 10 to learn that, in Excel, ‘paste ’ is function application. The “impact police ” might be amused by note 3 (page 57). Updated 16.7.2010 to include some factual corrections by DPC to the OpenMath discussion (at which he was unable to be present).Con ..."
Abstract
 Add to MetaCart
If you read nothing else, read footnote 1 on page 10 to learn that, in Excel, ‘paste ’ is function application. The “impact police ” might be amused by note 3 (page 57). Updated 16.7.2010 to include some factual corrections by DPC to the OpenMath discussion (at which he was unable to be present).Contents
11111111111111110000000 1111111
"... 0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111 ..."
Abstract
 Add to MetaCart
0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111 0000000000000000 11111111111111110000000 1111111
A proof of Bertrand’s postulate
"... We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime number theorem, his machinery ..."
Abstract
 Add to MetaCart
We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime number theorem, his machinery, and in particular the two functions ψ and θ still play a central role in the modern development of number theory. The proof makes use of most part of the machinery of elementary arithmetics, and in particular of properties of prime numbers, gcd, products and summations, providing a natural benchmark for assessing the actual development of the arithmetical knowledge base. 1.