Abstract
There is a long tradition of logic, from Aristotle to Gödel, of understanding a proof from the concepts of necessity and causality. Gödel's attempts to define provability in terms of necessity led him to the distinction of formal and absolute (abstract) provability. Turing's definition of mechanical procedure by means of a Turing machine (TM) and Gödel's definition of a formal system as a mechanical procedure for producing formulas prompt us to understand formal provability as a mechanical causality. We propose a formalism which makes explicit the mechanical causal nature of a TM's work. We claim that Gödel's axiomatised ontotheology and his ontological proof give a clue for the understanding of the concept of absolute provability and the pattern of the corresponding absolute completeness proof, respectively.