FOM: Decidable?

Hubert Wagner wagner at jupiter.cs.uni-dortmund.de
Tue Apr 16 05:00:30 EDT 2002


Is there an easy argument showing that the first order theory of 
positive natural numbers with multiplication and constants 1 and 2 is 
decidable?
Without constant2 the theory is decidable by results of Mostowski and 
Feferman&Vaught.

Hubert Wagner






More information about the FOM mailing list