 First-order reduction

In computer science, a first-order reduction is a very weak type of reduction between two computational problems in computational complexity theory.A first-order reduction is a reduction where each component is restricted to be in the class FO of problems calculable in first-order logic.