Bounded theories for polyspace computability

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorBianconi, Ricardo-
Autor(es): dc.creatorFerreira, Gilda-
Autor(es): dc.creatorSilva, Emmanuel-
Data de aceite: dc.date.accessioned2022-02-15T14:07:54Z-
Data de disponibilização: dc.date.available2022-02-15T14:07:54Z-
Data de envio: dc.date.issued2021-02-10-
Data de envio: dc.date.issued2021-02-10-
Data de envio: dc.date.issued2013-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/10400.2/10487-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/10400.2/10487-
Descrição: dc.descriptionWe 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.-
Descrição: dc.descriptioninfo:eu-repo/semantics/publishedVersion-
Idioma: dc.languageen-
Relação: dc.relationPTDC/MAT/104716/2008-
Relação: dc.relationinfo:eu-repo/grantAgreement/FCT/SFRH/SFRH%2FBPD%2F34527%2F2006/PT-
Relação: dc.relationPEst-OE/MAT/UI0209/2011-
Direitos: dc.rightsopenAccess-
Palavras-chave: dc.subjectBounded arithmetic-
Palavras-chave: dc.subjectWeak analysis-
Palavras-chave: dc.subjectPolyspace computability-
Palavras-chave: dc.subjectConservation results-
Título: dc.titleBounded theories for polyspace computability-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Aberto - Universidade Aberta (Portugal)

Não existem arquivos associados a este item.