Bounded theories for polyspace computability

Bibliographic Details
Main Author: Bianconi, Ricardo
Publication Date: 2013
Other Authors: Ferreira, Gilda, Silva, Emmanuel
Format: Article
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10400.2/10487
Summary: 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. Herbrand’s theorem, cut-elimination theorem and the expansion of models) are similar to the ones involved in the polytime setting, we focus on what is specific of polyspace and explains the lift from PTIME to PSPACE.
id RCAP_af2d99cb98f384559f00fc31487a7ea5
oai_identifier_str oai:repositorioaberto.uab.pt:10400.2/10487
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Bounded theories for polyspace computabilityBounded arithmeticWeak analysisPolyspace computabilityConservation resultsWe 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. Herbrand’s theorem, cut-elimination theorem and the expansion of models) are similar to the ones involved in the polytime setting, we focus on what is specific of polyspace and explains the lift from PTIME to PSPACE.Repositório AbertoBianconi, RicardoFerreira, GildaSilva, Emmanuel2021-02-11T11:56:01Z20132013-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.2/10487eng0032-515510.4171/PM/1936info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-02-26T09:54:12Zoai:repositorioaberto.uab.pt:10400.2/10487Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T21:11:38.089810Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Bounded theories for polyspace computability
title Bounded theories for polyspace computability
spellingShingle Bounded theories for polyspace computability
Bianconi, Ricardo
Bounded arithmetic
Weak analysis
Polyspace computability
Conservation results
title_short Bounded theories for polyspace computability
title_full Bounded theories for polyspace computability
title_fullStr Bounded theories for polyspace computability
title_full_unstemmed Bounded theories for polyspace computability
title_sort Bounded theories for polyspace computability
author Bianconi, Ricardo
author_facet Bianconi, Ricardo
Ferreira, Gilda
Silva, Emmanuel
author_role author
author2 Ferreira, Gilda
Silva, Emmanuel
author2_role author
author
dc.contributor.none.fl_str_mv Repositório Aberto
dc.contributor.author.fl_str_mv Bianconi, Ricardo
Ferreira, Gilda
Silva, Emmanuel
dc.subject.por.fl_str_mv Bounded arithmetic
Weak analysis
Polyspace computability
Conservation results
topic Bounded arithmetic
Weak analysis
Polyspace computability
Conservation results
description 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. Herbrand’s theorem, cut-elimination theorem and the expansion of models) are similar to the ones involved in the polytime setting, we focus on what is specific of polyspace and explains the lift from PTIME to PSPACE.
publishDate 2013
dc.date.none.fl_str_mv 2013
2013-01-01T00:00:00Z
2021-02-11T11:56:01Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.2/10487
url http://hdl.handle.net/10400.2/10487
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0032-5155
10.4171/PM/1936
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833599138267136000

Similar Items