No, second-order logic cannot be automated like first-order logic in terms of theorem proving. This is due to the fact that second-order logic is not complete; hence, there exists no complete, sound, and effective deduction system for it, unlike for first-order logic.