It is not the case that FO(LFP) is defined purely in terms of logical resources (first-order logic plus a least fixed point operator), not in terms of Turing machines or any specific computational model.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.