English

A robust proof-theoretic well-ordering

Logic 2022-09-22 v3

Abstract

It is well-known that natural axiomatic theories are pre-well-ordered by logical strength, according to various characterizations of logical strength such as consistency strength and inclusion of Π10\Pi^0_1 theorems. Though these notions of logical strength coincide for natural theories, they are not generally equivalent. We study analogues of these notions -- such as Π11\Pi^1_1-reflection strength and inclusion of Π11\Pi^1_1 theorems -- in the presence of an oracle for Σ11\Sigma^1_1 truths. In this context these notions coincide; moreover, we get genuine pre-well-orderings of axiomatic theories and may drop the non-mathematical quantification over "natural" theories.

Keywords

Cite

@article{arxiv.2201.05284,
  title  = {A robust proof-theoretic well-ordering},
  author = {James Walsh},
  journal= {arXiv preprint arXiv:2201.05284},
  year   = {2022}
}

Comments

This article has been merged with 2112.04980 to form 2209.09765

R2 v1 2026-06-24T08:49:43.194Z