Elliot Glazer(@ElliotGlazer):I now have a literal Peano Arithmetic proof that K215 halts iff ZFC is inconsistent, formally verified in Metamath Zero. K215 is a 215-state Turing machine discovered by @ereliuer_eteer, which encodes my single-schema set theory K.

Elliot Glazer

@ElliotGlazer

Unrestricted comprehension @PrincipiaLabs

Joined November 2024

1.1K Following 8.7K Followers

Elliot Glazer@ElliotGlazer

2026.10.23 17:34

I now have a literal Peano Arithmetic proof that K215 halts iff ZFC is inconsistent, formally verified in Metamath Zero. K215 is a 215-state Turing machine discovered by @ereliuer_eteer, which encodes my single-schema set theory K.

129

Forward to community

Most Popular Users

1M Followers

958.4K Followers

579.3K Followers

1.1M Followers

504K Followers

2.8M Followers

6.3M Followers

347.8K Followers

4.3M Followers

The Wall Street Journal

22.3M Followers

672.2K Followers

1.2M Followers

16.1M Followers

825.4K Followers

26.5M Followers