sentences:  FO (complexity)
  
  In descriptive complexity, a branch of computational complexity, FO is a complexity class of structures that can be recognized by formulas of first-order logic, and also equals the complexity class AC0.Descriptive complexity uses the formalism of logic, but does not use several key notions associated with logic such as proof theory or axiomatization.