[complexity] In descriptive complexity, a branch of computational complexity, FO is a complexity class of structures which 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 ... Found on http://en.wikipedia.org/wiki/FO_(complexity)
A warm dry wind on the lee side of a mountain range. The heating and drying are due to adiabatic compression as the wind descend downslope. Found on http://ggweather.com/glossary.htm