Techniques in weak analysis for conservation results

Detalhes bibliográficos
Autor(a) principal: Fernandes, António
Data de Publicação: 2013
Outros Autores: Ferreira, Fernando, Ferreira, Gilda
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10400.2/10484
Resumo: We review and describe the main techniques for setting up systems of weak analysis, i.e. formal systems of second-order arithmetic related to subexponential classes of computational complexity. These involve techniques of proof theory (e.g., Herbrand’s theorem and the cut-elimination theorem) and model theoretic techniques like forcing. The techniques are illustrated for the particular case of polytime computability. We also include a brief section where we list the known results in weak analysis.
id RCAP_8e42a86e21b75de8e457227c2c8f0b49
oai_identifier_str oai:repositorioaberto.uab.pt:10400.2/10484
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str
spelling Techniques in weak analysis for conservation resultsWeak analysisConservation resultsBounded arithmeticCut-eliminationForcingPolytime computabilityWe review and describe the main techniques for setting up systems of weak analysis, i.e. formal systems of second-order arithmetic related to subexponential classes of computational complexity. These involve techniques of proof theory (e.g., Herbrand’s theorem and the cut-elimination theorem) and model theoretic techniques like forcing. The techniques are illustrated for the particular case of polytime computability. We also include a brief section where we list the known results in weak analysis.CSLI Lecture Notes Number 211Repositório AbertoFernandes, AntónioFerreira, FernandoFerreira, Gilda2021-02-11T10:26:10Z2013-092013-09-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.2/10484eng9781575867243 (Online)9781575867236 (Print)info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-07T16:10:19ZPortal AgregadorONG
dc.title.none.fl_str_mv Techniques in weak analysis for conservation results
title Techniques in weak analysis for conservation results
spellingShingle Techniques in weak analysis for conservation results
Fernandes, António
Weak analysis
Conservation results
Bounded arithmetic
Cut-elimination
Forcing
Polytime computability
title_short Techniques in weak analysis for conservation results
title_full Techniques in weak analysis for conservation results
title_fullStr Techniques in weak analysis for conservation results
title_full_unstemmed Techniques in weak analysis for conservation results
title_sort Techniques in weak analysis for conservation results
author Fernandes, António
author_facet Fernandes, António
Ferreira, Fernando
Ferreira, Gilda
author_role author
author2 Ferreira, Fernando
Ferreira, Gilda
author2_role author
author
dc.contributor.none.fl_str_mv Repositório Aberto
dc.contributor.author.fl_str_mv Fernandes, António
Ferreira, Fernando
Ferreira, Gilda
dc.subject.por.fl_str_mv Weak analysis
Conservation results
Bounded arithmetic
Cut-elimination
Forcing
Polytime computability
topic Weak analysis
Conservation results
Bounded arithmetic
Cut-elimination
Forcing
Polytime computability
description We review and describe the main techniques for setting up systems of weak analysis, i.e. formal systems of second-order arithmetic related to subexponential classes of computational complexity. These involve techniques of proof theory (e.g., Herbrand’s theorem and the cut-elimination theorem) and model theoretic techniques like forcing. The techniques are illustrated for the particular case of polytime computability. We also include a brief section where we list the known results in weak analysis.
publishDate 2013
dc.date.none.fl_str_mv 2013-09
2013-09-01T00:00:00Z
2021-02-11T10:26:10Z
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/10484
url http://hdl.handle.net/10400.2/10484
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 9781575867243 (Online)
9781575867236 (Print)
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.publisher.none.fl_str_mv CSLI Lecture Notes Number 211
publisher.none.fl_str_mv CSLI Lecture Notes Number 211
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1777302857028993024

Registros relacionados