On the Logical Definability of Some Maximum Leaves Problems