[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:

View post   
>> No.15085069 [View]
File: 927 KB, 1x1, Constructive Set Theory.pdf [View same] [iqdb] [saucenao] [google]
15085069

>>15085051
>He believes a random e-celebrity posting bullshit on Twitter
Get a clue stinky

>> No.15049492 [View]
File: 927 KB, 1x1, CST_Book_draft_A_R.pdf [View same] [iqdb] [saucenao] [google]
15049492

>>15049466
Maybe to add, S_CH is uncountable because you can't name the counting function explicit (The classical options being the empty counting function out of 0 when CH is rejectable and the constant function out of 1 when CH is provable.). It's not uncountable because it's somehow "bigly".

Also, If undecidable if-clauses don't make for legal functions, most theories won't claim uncodable functions exits. Thus, N^N is permitted to be small since codable functions is a mode

>>15049466
>book draft
Now appened

The paper I had appened above does Heyting arithmetic in the first half and then goes on to non-classical theories.

Navigation
View posts[+24][+48][+96]