Dilatorial characterization conjecture for beta-models of strong systems
Dilatorial characterization conjecture for beta-models of strong systems
Let be a strong system with an ordinal analysis based on ordinal representation systems . These systems give rise to functors
that send dilators to ordinal representation systems. Dilatorial characterization conjecture. The assertion that sends dilators to well-orderings is equivalent to the statement that every set is contained in a countably coded -model of . The claim is presented as a general conjecture extending the established characterization for -models of -comprehension, but no proof or resolution is supplied.
Sources & referencesView supporting material
Primary source
Michael Rathjen, “Well-Ordering Principles in Proof Theory and Reverse Mathematics”, arXiv:2010.12453 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.