PH is the complexity class that is the set of languages expressible by second-order logic. If so, is there any complexity class that is the set of languages expressible by first-order logic?
It seems likely that R is the complexity class that is the set of languages expressible by first-order logic, but I am not really sure.