Good proof methods are symbolic computations. Hoare logic and the predicate calculus are the two major examples I know of. In fact in my personal favorite forma

Good proof methods are symbolic computations. Hoare logic and the predicate calculus are the two major examples I know of. In fact in my personal favorite formalism, a proof is actually rather a lot like an equation[1]. It's an observable reality that most "pure" mathematical proofs are rather less rigorous than the best CS work, simply because peer reviewers are rather more lenient than computing machines. https://www.cs.utexas.edu/users/EWD/transcriptions/EWD13xx/EWD1300.html https://www.cs.utexas.edu/users/EWD/transcriptions/EWD13xx/E...