« first day (65 days earlier)
← previous day
next day →
last day (434 days later) »
Secret
02:44
@SimplyBeautifulArt Since fundamental sequences are basically well ordered sets themselves with order type $\omega$, does it mean it is the same as the countable cartesian product of a sequence of ordinals in ascending order, i.e. a $\omega$-tuple?
Secret
02:57
...
ccs.neu.edu/home/pete/courses/Formal-methods/2008-Fall/lectures/…
Secret
03:15
→
2 messages
moved to
trash
1 hour later…
Secret
04:16
→
8 messages
moved to
trash
1 hour later…
Secret
05:34
→
9 messages
moved to
trash
→
1 message
moved to
trash
→
1 message
moved to
trash
Secret
06:17
→
1 message
moved to
trash
→
1 message
moved to
trash
1 hour later…
Secret
07:30
→
30 messages
moved to
Mathematical formulation of Quantum mechanics
5 hours later…
Simply Beautiful Art
12:31
@Secret idk/probably
11 hours later…
Secret
23:49
$\hookrightarrow$
Summary with some corrections
Tier 0:
ZF Set theory; Type Theory
$0 = \varnothing; 0 : \text{Nat}$
Tier 1:
$\{\forall n : n^+ = n \cup \{n\}\}$ Base case=0;
$0 : \text{Nat}$
$\text{Succ : Nat $\to$ Nat}$
$\text{True, False : Bool}$
« first day (65 days earlier)
← previous day
next day →
last day (434 days later) »
all rooms
Transcript for
Nov
23
Nov '17
26
Nov
27
Mathworks (Not the main chat!)
Maths department of SecretLabs SE Branch (
chat.stackexchange.c...
join this room
about this room
00:00
06:00
12:00
18:00
all times are UTC
site design / logo © 2025 Stack Exchange Inc;
legal
mobile