Bounded arithmetic
id:
bounded-arithmetic-303-9225028
title:
Bounded arithmetic
text:
Bounded arithmetic is a collective name for a family of weak subtheories of Peano arithmetic. Such theories are typically obtained by requiring that quantifiers be bounded in the induction axiom or equivalent postulates. The main purpose is to characterize one or another class of computational complexity in the sense that a function is provably total if and only if it belongs to a given complexity class. Further, theories of bounded arithmetic present uniform counterparts to standard proposition
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bounded_arithmetic
date created:
date modified:
2023-07-22T16:17:13Z
main entity:
{"identifier":"Q28403712","url":"https://www.wikidata.org/entity/Q28403712"}
image:
fields total:
13
integrity:
13