Historically, the LCF tradition of interactive theorem proving was tied to the read-eval-print
loop, with sequential and synchronous evaluation of prover commands given on the …

We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing
Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a …

Matita [4] is a dependently-typed interactive prover under development at the Computer
Science Department of the University of Bologna. An interactive prover is a software tool …

∀ProofPeer Page 1 Submitted to: arXiv.org c S. Obua, J. Fleuriot, P. Scott & D. Aspinall
ProofPeer: Collaborative Theorem Proving A Position Paper Steven Obua Jacques Fleuriot Phil …

The recent achievements obtained by means of Interactive Theorem Provers in the
automatic verification of complex mathematical results have reopened an old and interesting …

In this paper, we discuss the formalization of the well known Gap Theorem of Complexity
Theory, asserting the existence of arbitrarily large gaps between complexity classes. The …

The Agora system is a prototypical Wiki for formal mathematics: a web-based system for
collaborating on formal mathematics, intended to support informal documentation of formal …

Reverse Complexity is a long term research program aiming at discovering the abstract,
logical principles underlying Complexity Theory, by means of a formal, reverse analysis of its …

There is only one name on the front of this thesis, but as any researcher can tell you, you
cannot do research and produce a thesis on your own. I have been especially fortunate to …

In the recent years, there have been significant advances in formalization of mathematics,
involving a number of large-scale formalization projects. This naturally poses a number of …