A ``theory'' in Logic is decidable if there is an Algorithm that will decide on input whether or not is a Sentence true of the Field of Real Numbers .

**References**

Kemeny, J. G. ``Undecidable Problems of Elementary Number Theory.'' *Math. Ann.* **135**, 160-169, 1958.

© 1996-9

1999-05-24