Timeline for Anti-foundational set theory with a universal set
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2019 at 10:18 | history | edited | Zuhair Al-Johar | CC BY-SA 4.0 |
deleted 1 character in body
|
| Oct 18, 2019 at 10:11 | history | edited | Zuhair Al-Johar | CC BY-SA 4.0 |
deleted 1 character in body
|
| Oct 17, 2019 at 16:58 | comment | added | Zuhair Al-Johar | For the case of NFU, its simply identity map on cardinality of $V$, i.e. on the equivalence class of all sets of the same size as $V$. For the rest, they are obvious. | |
| Oct 17, 2019 at 12:11 | history | edited | Zuhair Al-Johar | CC BY-SA 4.0 |
added 315 characters in body
|
| Oct 17, 2019 at 11:56 | history | edited | Zuhair Al-Johar | CC BY-SA 4.0 |
added 315 characters in body
|
| Oct 17, 2019 at 11:47 | history | edited | Zuhair Al-Johar | CC BY-SA 4.0 |
added 315 characters in body
|
| Oct 17, 2019 at 8:13 | comment | added | user44143 | Ok. What mapping establishes the equality? (It’s not obvious to me yet.) | |
| Oct 17, 2019 at 5:13 | comment | added | Zuhair Al-Johar | @MattF. in reality |N| can be countable if we assume NFU + negation of infinity, or it can be uncountable if we assume NFU+infinity. In reality it doesn't matter. I've changed |N| to N to enforce the countable condition in both cases. | |
| Oct 17, 2019 at 5:11 | history | edited | Zuhair Al-Johar | CC BY-SA 4.0 |
deleted 2 characters in body
|
| Oct 17, 2019 at 0:36 | comment | added | user44143 | Is $|N|$ countable? I’d assume no, which would mean that this is an interesting almost-solution to the equation. | |
| Oct 16, 2019 at 19:01 | history | answered | Zuhair Al-Johar | CC BY-SA 4.0 |