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.
- Hyperbola Inverse Curve
- Hyperbola Pedal Curve
- Hyperbolic Automorphism
- Hyperbolic Cosecant
- Hyperbolic Cosine
- Hyperbolic Cotangent
- Hyperbolic Cube
- Hyperbolic Cylinder
- Hyperbolic Dodecahedron
- Hyperbolic Fixed Point (Differential Equations)
- Hyperbolic Fixed Point (Map)
- Hyperbolic Functions
- Hyperbolic Geometry
- Hyperbolic Inverse Functions
- Hyperbolic Knot
- Hyperbolic Lemniscate Function
- Hyperbolic Map
- Hyperbolic Metric
- Hyperbolic Octahedron
- Hyperbolic Paraboloid
- Hyperbolic Partial Differential Equation
- Hyperbolic Plane
- Hyperbolic Point
- Hyperbolic Polyhedron
- Hyperbolic Rotation