| Information | |
|---|---|
| has gloss | eng: In descriptive complexity theory, FO is the complexity class of all languages which can be specified using first-order logic. Adding the BIT predicate results in the class FO+BIT. In circuit complexity, FO can be shown to be equal to AC0, the first class in the AC hierarchy. |
| lexicalization | eng: FO |
| instance of | e/Complexity class |
Lexvo © 2008-2026 Gerard de Melo. Contact Legal Information / Imprint