- I think Anselm did a good thing with his proof. Things were unclear until Godel put the whole thing into simple logical form. I tried to reinforce it with another theorem of Godel. This is the theorem: Compactness Theorem). A set of formulas Γ is satisfiable if and only if every finite subset of Γ is satisfiable.] [From the finite to the infinite. Perhaps the simplest use of the Compactness Theorem is to show that if there exist arbitrarily large finite objects of some type, then there must also be an infinite object of this type.] [Mathematical Logic ch 4 and ch 9][http://euclid.trentu.ca/math/sb/pcml/pcml-16.pdf
However I also the alternative Medieval approach based on Aristotle that Ed Feser is recommending makes sense.
