The Kaufmann--Clote question on end extensions of models of arithmetic and the weak regularity principle
Mengzhou Sun

TL;DR
This paper explores the conditions under which models of arithmetic can be extended end-wise while preserving certain properties, introducing a new regularity principle to connect model extendibility with induction principles.
Contribution
It provides a positive answer to Clote's question on end extensions and characterizes models of arithmetic via end extendibility, introducing the weak regularity principle.
Findings
Constructed proper $ ext{Σ}_{n+2}$-elementary end extensions satisfying $ ext{B} ext{Σ}_{n+1}$.
Characterized models of $ ext{I} ext{Σ}_{n+2}$ through end extendibility.
Introduced the weak regularity principle linking end extendibility and induction.
Abstract
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each and any countable model of , we construct a proper -elementary end extension satisfying , which answers a question by Clote positively. We also give a characterization of countable models of in terms of their end extendibility similar to the case of . Along the proof, we will introduce a new type of regularity principles in arithmetic called the weak regularity principle, which serves as a bridge between the model's end extendibility and the amount of induction or collection it satisfies.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · Computability, Logic, AI Algorithms · Advanced Topology and Set Theory
