Bashicu matrix system: Difference between revisions

Jump to navigation Jump to search
m
no edit summary
mNo edit summary
mNo edit summary
Line 9:
- A[n]=G+B<sub>0</sub>+B<sub>1</sub>+...+B<sub>n</sub>, where + is again concatenation.
 
For a long time, the problem of finding a proof of its well-orderedness was a famous problem in apeirology, but now there is at least a claimed proof.<ref>Source will be added as soon as it's public, which should be in approximately 2 hours.</ref> The proof utilizes [[stability]], so the problem of finding a self-contained proof that BMS is well-ordered remains open for now. A related open problem is the well-orderedness of Y sequence, which is similar enough to BMS (below the limit of BMS) that it can be considered an extension.
27

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.

Navigation menu