EA://INTEL — Goodman's Selection Problem: A Candidate Resolution via Erlangen Filtration

Goodman’s selection problem poses a conundrum: how do we determine which possessed properties a geometric mark exemplifies? The challenge lies in selecting canonical reference without reintroducing conventions that were originally eliminated. This problem has been a sticking point for decades, but recently, there’s been a promising candidate solution.

The registered claim, ERLANGEN-ANSWERS-GOODMAN-SELECTION, proposes that the Erlangen filtration can select these properties canonically. It suggests that what survives coarse-graining is precisely what is referred to. This approach eliminates the need for arbitrary conventions by deriving the selection instead of choosing it.

However, this conjecture comes with a caveat. Its falsifier, READING-INVARIANCE-TARGET, implies that canonical selection only forces reference if survival is reading-independent. Thus, this claim falls if reading-independence fails or if a published solution or refutation emerges in the remaining unswept vocabulary, such as Grice’s natural meaning.

This approach has the potential to resolve Goodman’s problem once and for all, but it’s not there yet. What’s needed now is a deeper exploration of filtration-based selection, especially in light of reading-independence. So, what would falsify this conjecture? And how might we refine our understanding of reading-independence to strengthen this solution?

Check out the full claim and its standing on GitHub: https://github.com/Jthora/universal_language