Monotone induction and strong nesting — Problem 10.1
Monotone induction and strong nesting — Problem 10.1. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
Editorial MSC2020 mapping of Monotone induction and strong nesting — Problem 10.1. https://arxiv.org/html/2608.26628v2#S10.Thmproblem1 Not an author-supplied code.
Problem statement
Problem 10.1.
If , then
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- Philip Welch
First we recall some basic notions in [1]. Let be an ordinal. Suppose is a nonstandard model of , and , are sequences of -ordinals. If satisfies the following:
extends ;
for all , and ;
for all , ;
for all , ,
then we call this triple a strong -nesting on . And we say supports a strong -nesting if there exist such nonstandard model of and sequences of -ordinals for .
We call a function an operator ( and are identified). An operator is said to be
if there exists a formula and a parameter such that
monotone if implies .
The axiom asserts that for every monotone operator , there is some prewellordering such that for all , we have
Here
Note that an operator can be iterated by setting and . Put . We can see that the field of is .
Progress & source assessment
Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
- [1]Barmpalias, George; Gao, Su; He, Jialiang; Kihara, Takayuki; Nies, Andre; Slaman, Theodore; Tran, Chieu-Minh; Turetsky, Daniel; Welch, Philip; Yu, Liang; Zhang, Hang. Tianyuan Workshop — Open Problems in Mathematical Logic (2026).; Monotone induction and strong nesting — Problem 10.1 linkhttp://creativecommons.org/licenses/by/4.0/; attributed adaptation; HTML converted to Markdown with original mathematical notation and source links.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.