Decidable
A ``theory'' in Logic is decidable if there is an Algorithm that will decide on input 
whether ornot 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.
- Similarity Transformation
- Similitude Center
- Similitude Ratio
- Simple Algebra
- Simple Continued Fraction
- Simple Curve
- Simple Graph
- Simple Group
- Simple Harmonic Motion
- Simple Harmonic Motion Quadratic Perturbation
- Simple Harmonic Oscillator
- Simple Interest
- Simple Polygon
- Simple Ring
- Simplex
- Simplex Method
- Simplicial Complex
- Simplicial Homology
- Simplicity
- Simply Connected
- Simpson's 3/8 Rule
- Simpson's Paradox
- Simpson's Rule
- Simson Line
- Sinc Function