Here is the direct quote:
"In the calculational case, oneÂ’s typically dealing with an operation
to be performed. In the Wolfram|Alpha-like pure mathematical case,
oneÂ’s typically just giving a description of something. In some cases
that description will be explicit. A specific number. A particular
equation. A specific graph. But more often it will be implicit. It
will be a set of constraints. One will say (to use the example from
above), “Let F be a field,” and then one will give constraints that
the field must satisfy.
But to really be useful in pure mathematics, thereÂ’s something else
thatÂ’s needed. In addition to being able to deal with concrete
mathematical objects, one also has to be able to deal with abstract
mathematical structures. Countless pure mathematical papers start with
things like, “Let F be a field with such-and-such properties.” We need
to be able to enter something like this—then have our system
automatically give us interesting facts and theorems about F, in
effect creating a whole automatically generated paper that tells the
story of F.
So what would be involved in creating a system to do this? Is it even
possible? There are several different components, all quite difficult
and time consuming to build. But based on my experiences with
Mathematica, Wolfram|Alpha, and A New Kind of Science, I am quite
certain that with the right leadership and enough effort, all of them
can in fact be built."
Consider the exact example he gives of something Mathematica cannot represent - "Let F be a field with such-and-such properties". Consider the first axiom I have in my original post - "M3 is a metric space with a metric tensor g". From the point of view of level of abstraction, they seem to be similar.
Your example shows that theorem proving in possible using simple propositional calculus and first-order logic constructs. This is well known to me. However, my question is whether Mathematica can provide a True/False answer (which is a strictly weaker requirement than actually proving that answer. I would love to have a proof, but at this point I don't expect it) to statements involving abstract mathematical structures like fields. A first order logic statement does not involve abstract mathematical structures. From the above quotation, Wolfram's answer appears to be that this is not possible at present.
It seems that True/False answers involving arithmetic are possible. I was able to ask Mathematica if the square root of 2 is rational, and it replied with False, although I don't believe a proof can be generated at present. Theorema (an add-on package for Mathematica) should eventually be able to provide proofs of things like this, but cannot at present.
I would LOVE to be proved wrong. In fact, I posted this question hoping that I'll be proved wrong. But that would involve someone providing a Wolfram Language translation of say, the first axiom I provide. If someone knows of an add-on or different algebra system (Magma?) that makes this possible, I'd be delighted as well.