Techniques in weak analysis for conservation results

Fernandes, António; Ferreira, Fernando; Ferreira, Gilda

http://hdl.handle.net/10400.2/10484

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
Techniques.pdf		150.47 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Fernandes, António

Ferreira, Fernando

Ferreira, Gilda

Resumo(s)

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.