Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> Since there are only a countable number of formulas, there are only countably many definable reals

It always seemed like it should matter that the constructable formula strings include strings that define multiple numbers (e.g. "three; also pi squared") which at least seems like it should be aleph one rather than aleph nought, but smarter people than me assure me it doesn't work that way for (reasons)




that redundancy will only decrease the number of definables, no?

and countable infinity is already the smallest one, so you can't get smaller




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: