Ask HN: Comparing first/2nd order logic approaches an apples/oranges attempt??

Is directly comparing 1st order logic based implimentations and 2nd order logic based implimentations an apples to oranges comparison? 2nd order at least implicitly has bounds, vs. 1st order unlimited Godel references. ( https://news.ycombinator.com/item?id=106347 ) Isn't this like trying to compare __init__ / RTTI with the way prolog is coded.