Talk:Logic for Computer Science/First-Order Logic

There is an axiom for mod missing, something like

mod(m,n,s) <=> (exists r: Nat . m = n*r + s /\ s < n).

This axiom also implies NT 14.

Moreover, the 14 axioms should not be called "the axioms" for numbers, but only "some axioms". After all, the Peano axiom is missing. NT3 is only a very weak form of it, and not even the strongest possible first-order form. Till


 * Feel free to make the changes. MShonle 22:46, 13 Feb 2005 (UTC)