13 documents found, page 1 of 2

Sort by Issue Date




Bounded theories for polyspace computability

Bianconi, Ricardo; Ferreira, Gilda; Silva, Emmanuel

We present theories of bounded arithmetic and weak analysis whose provably total functions (with appropriate graphs) are the polyspace computable functions. More precisely, inspired in Ferreira’s systems PTCA, Sigma^b_1-NIA and BTFA in the polytime framework, we propose analogue theories concerning polyspace computability. Since the techniques we employ in the characterization of PSPACE via formal systems (e.g....








13 Results

Queried text

Refine Results

Author




Date













Document Type



Funding



Access rights


Resource



Subject