FOM: decidability of sets of axioms
wtait at ix.netcom.com
Thu Dec 11 23:30:33 EST 1997
Its likely that you haven't stated what you mean.
Let P be some non-logical (i.e. falsifiable) sentence which is true in M
(e.g. the sentence that there are at least two elements, or whatever).
Let X consist of the conjunctions P and Q, where Q is in X_0. (Since X_o
and X are to consist of sentences true in M, the requirement of
consistency is redundant.)
More information about the FOM