bounded arithmetic
Description: A family of weak arithmetic theories studied in mathematical logic, proof complexity, and computational complexity, often using bounded quantifiers.
Primary topic: Computability, Logic, AI Algorithms (34%)
Wikidata ID: wiki/Q28403712
OpenAlex ID: keywords/bounded-arithmetic
