OpenFrontiers
← Back to the index
OP-11836Status unassessedLogic and foundations

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.

Licensed source statementAs of 2608.26628v2; current status unassessedSource & evidence ↓

Problem statement

Problem 10.1.

If Lβ⊨V=HCL_{\beta}\models{\mathit{V}=\mathit{HC}}, then

(P(ω)∩Lβ⊨Πm+11−MI )  ⟺  β\mboxsupportsastrongΣm+1-nesting.\left(\mathcal{P}(\omega)\cap L_{\beta}\models\boldsymbol{\Pi}_{m+1}^{1}\mathsf{-MI}\,\right)\iff\beta\mbox{ supports a strong }\Sigma_{m+1}\textrm{-nesting}.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

  1. Philip Welch

First we recall some basic notions in [1]. Let β\beta be an ordinal. Suppose MM is a nonstandard model of KP\mathsf{KP}, and {ζi:i∈N}\{\zeta_{i}:i\in\mathbb{N}\}, {si:i∈N}\{s_{i}:i\in\mathbb{N}\} are sequences of MM-ordinals. If (M,{ζi:i∈N},{si:i∈N})\left(M,\{\zeta_{i}:i\in\mathbb{N}\},\{s_{i}:i\in\mathbb{N}\}\right) satisfies the following:

MM extends LβL_{\beta};

for all ii, ζi<ζi+1<β\zeta_{i}<\zeta_{i+1}<\beta and si+1<Msis_{i+1}<^{M}s_{i};

for all ii, Lζi≺Σm+1LsiML_{\zeta_{i}}\prec_{\Sigma_{m+1}}L_{s_{i}}^{M};

for all ii, Lsi+1M≺Σm−1LsiML_{s_{i+1}}^{M}\prec_{\Sigma_{m-1}}L_{s_{i}}^{M},

then we call this triple a strong Σm+1\Sigma_{m+1}-nesting on β\beta. And we say β\beta supports a strong Σm+1\Sigma_{m+1}-nesting if there exist such nonstandard model MM of KP\mathsf{KP} and sequences {ζi:i∈N},{si:i∈N}\{\zeta_{i}:i\in\mathbb{N}\},\{s_{i}:i\in\mathbb{N}\} of MM-ordinals for LβL_{\beta}.

We call a function Φ:R→R\Phi:\mathbb{R}\to\mathbb{R} an operator (P(N)\mathcal{P}(\mathbb{N}) and R\mathbb{R} are identified). An operator Φ\Phi is said to be

Πm1\boldsymbol{\Pi}_{m}^{1} if there exists a Πm1\boldsymbol{\Pi}_{m}^{1} formula ϕ\phi and a parameter YY such that

∀n ∀X(n∈Φ(X)↔ϕ(n,X,Y));\forall n\,\forall X\left(n\in\Phi(X)\leftrightarrow\phi(n,X,Y)\right);

monotone if X⊆YX\subseteq Y implies Φ(X)⊆Φ(Y)\Phi(X)\subseteq\Phi(Y).

The axiom Πm+11−MI\boldsymbol{\Pi}_{m+1}^{1}\mathsf{-MI} asserts that for every monotone Πm+11\boldsymbol{\Pi}_{m+1}^{1} operator Φ\Phi, there is some prewellordering WW such that for all a∈field(W)=dom(W)∪ran(W)a\in\textrm{field}(W)=\textrm{dom}(W)\cup\textrm{ran}(W), we have

Wa=Φ(W<a).W_{a}=\Phi(W_{<a}).

Here

Wa={b:a<Wb},W_{a}=\{b:a<_{W}b\}, W<a=⋃{Wb:b<Wa}.W_{<a}=\bigcup\{W_{b}:b<_{W}a\}.

Note that an operator Φ\Phi can be iterated by setting Φ0=∅,Φ<α=⋃γ<αΦγ\Phi^{0}=\emptyset,\Phi^{<\alpha}=\bigcup_{\gamma<\alpha}\Phi^{\gamma} and Φα=Φ(Φ<α)\Phi^{\alpha}=\Phi(\Phi^{<\alpha}). Put Φ∞=⋃αΦα\Phi^{\infty}=\bigcup_{\alpha}\Phi^{\alpha}. We can see that the field of WW is Φ∞\Phi^{\infty}.

Progress & source assessment

Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

References
  1. [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 recorded

Attempts 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 notes

Notes 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.