Proofs that Modify Proofs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Towsner, Henry
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866916178067193856
author Towsner, Henry
author_facet Towsner, Henry
contents In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent functions on proof trees as yet further proof trees satisfying a suitable analog of well-foundedness. Iterating this process allows us to represent higher order functions as well: since functions on proof trees are just proof trees themselves, these functions can easily be extended to act on proof trees which are themselves understood as functions. The corresponding system of ordinals parallels this, using higher order collapsing function.
format Preprint
id arxiv_https___arxiv_org_abs_2403_17922
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Proofs that Modify Proofs
Towsner, Henry
Logic
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent functions on proof trees as yet further proof trees satisfying a suitable analog of well-foundedness. Iterating this process allows us to represent higher order functions as well: since functions on proof trees are just proof trees themselves, these functions can easily be extended to act on proof trees which are themselves understood as functions. The corresponding system of ordinals parallels this, using higher order collapsing function.
title Proofs that Modify Proofs
topic Logic
url https://arxiv.org/abs/2403.17922