Saved in:
Bibliographic Details
Main Author: Gadsby, Elijah
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2509.19373
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914052752539648
author Gadsby, Elijah
author_facet Gadsby, Elijah
contents A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where $x{:}_{\text{PA}} y$ is a suitable proof predicate. These notions were introduced by Artemov in his analysis of consistency and the formalisation of metamathematics. These matters aside, the notion is intimately connected with that of relative consistency. This paper will give an overview of the mathematical properties of selector proofs. Topics include: the relationship between selector proofs, ordinary provability and the omega rule, the relationship between selector proofs and relative consistency, iterated selector proofs, and the complexity of selectors.
format Preprint
id arxiv_https___arxiv_org_abs_2509_19373
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Properties of Selector Proofs
Gadsby, Elijah
Logic
03F40
A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where $x{:}_{\text{PA}} y$ is a suitable proof predicate. These notions were introduced by Artemov in his analysis of consistency and the formalisation of metamathematics. These matters aside, the notion is intimately connected with that of relative consistency. This paper will give an overview of the mathematical properties of selector proofs. Topics include: the relationship between selector proofs, ordinary provability and the omega rule, the relationship between selector proofs and relative consistency, iterated selector proofs, and the complexity of selectors.
title Properties of Selector Proofs
topic Logic
03F40
url https://arxiv.org/abs/2509.19373