 Finitely presented groups satisfying sufficiently strong small cancellation conditions are word hyperbolic and have word problem solvable by Dehn's algorithm.Small cancellation methods are also used for constructing Tarski monsters, and for solutions of Burnside's problem.Some ideas underlying the small cancellation theory go back to the work of Max Dehn in the 1910s.