Is there any result about the extension of first order logic with least fixed point operator, being complete (as logic in general on infinite structures too) or not? In other words does the Goedel completeness theorem of first order logic extent to such FO-LFP logic ? 
Completeness and first order logic with Least fixed point operator (LFP)
first order logic;descriptive complexity