A countable first-order theory T is called totally transcendental if it has no model M with a binary tree of consistent L(M)-formulas. Equivalently T is totally transcendental if ever formula has Morley rank less than infinity. ::: ::: :::