Would undecidability in ZFC of the Laver Table conjecture imply its truth/falsity?

89 Views Asked by At

The Laver Table conjecture is the conjecture that the first-row periods of Laver Tables are unbounded. Richard Laver proved in ZFC + rank-into-rank that it holds, but it is not known whether it is provable in ZFC by itself. But suppose someone proves that it is undecidable in ZFC by itself. Would that imply that the Laver Table conjecture is true/false?