Abstract. We expose a formalism that allows the expression of any theory with one or more axiom schemes using a finite number of axioms. This allows us to give finite first-order axiomatizations of arithmetic and real analysis, and a presentation of arithmetic in deduction modulo that has a finite number of rewrite rules. Overall, this formalization relies on a weak calculus of explicit substitutions to provide a simple and finite framework. 1