Reducing ω-model reflection to iterated syntactic reflection

DOI10.1142/S0219061322500015MaRDI QIDQ6038474zbMATH OpenOpenAlexFDO

Authors

Publication date 2 May 2023

Published in Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.12147

zbMATH Keywords

ordinal analysissecond-order arithmeticreflection principles

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Abstract: In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic reflection principles assert that every provable sentence from some complexity class is true. In this paper we study connections between these two kinds of reflection principles in the setting of second-order arithmetic. We prove that, for a large swathe of theories, $omega$-model reflection is equivalent to the claim that arbitrary iterations of uniform $P{i}_1^1$ reflection along countable well-orderings are $P{i}_1^1$-sound. This result yields uniform ordinal analyses of theories with strength between $mathsf{ACA}_0$ and $mathsfATR$. The main technical novelty of our analysis is the introduction of the notion of the proof-theoretic dilator of a theory $T$, which is the operator on countable ordinals that maps the order-type of $prec$ to the proof-theoretic ordinal of $T+mathsfWO(prec)$. We obtain precise results about the growth of proof-theoretic dilators as a function of provable $omega$-model reflection. This approach enables us to simultaneously obtain not only $P{i}_1^0$, $P{i}_2^0$, and $P{i}_1^1$ ordinals but also reverse-mathematical theorems for well-ordering principles.

Cites work

• scientific article; zbMATH DE number 4033738 (Why is no real title available?)
• scientific article; zbMATH DE number 3668596 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• Bar induction and \(\omega\) model reflection
• Iterated reflection principles and the ω-rule
• Proof theory. The first step into impredicativity
• Proof-theoretic analysis by iterated reflection
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Reflection ranks and ordinal analysis
• Reverse mathematics and well-ordering principles: a pilot study
• Saturated models of universal theories
• Subsystems of second order arithmetic
• The Veblen functions for computability theorists
• The model-theoretic ordinal analysis of theories of predicative strength
• Transfinite recursive progressions of axiomatic theories
• Π12-logic, Part 1: Dilators

Cited in

(3)

• A note on fragments of uniform reflection in second order arithmetic
• Corrigendum to Reducing ω-model reflection to iterated syntactic reflection
• Generalized fusible numbers and their ordinals

This page was built for publication: Reducing ω-model reflection to iterated syntactic reflection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038474)