[ home / overboard ] [ soy / qa / raid / r ] [ int / pol ] [ a / an / asp / biz / mtv / r9k / tech / v / sude / x ] [ q / news / chive / rules / pass / bans / status ] [ wiki ]

A banner for soyjak.party

/soy/ - Soyjaks

The Serious Boardβ„’ for feedback, suggestions, and metawhining
Catalog
Email
Subject
Comment
File
Password (For file deletion.)

File: 1785034731082a.png πŸ“₯︎ (194.6 KB, 600x338) ImgOps

 β„–17305058[Quote]

Gather nusois and prove your logic skills

 β„–17305079[Quote]

File: ClipboardImage.png πŸ“₯︎ (41.2 KB, 225x225) ImgOps

>Pinocchio

 β„–17305080[Quote]

brapzil

 β„–17305089[Quote]


 β„–17305130[Quote]

File: 1784003618387s.png πŸ“₯︎ (542.77 KB, 1024x1024) ImgOps

>E

 β„–17305141[Quote]

File: 1784091414941o(1).mp4 πŸ“₯︎ (129 KB, 256x144) ImgOps

>all my hats are green

 β„–17305144[Quote]

My brain has been so fried by years of agony that I can't interact with this

 β„–17305149[Quote]

forall x ((Hat(x) AND Own(P,x)) -> Green(x))

P always lies, so this statement is false:
NOT forall x ((Hat(x) AND Own(P,x)) -> Green(x))

Negating:
exists x (Hat(x) AND Own(P,x) AND NOT Green(x))

Therefore:
exists x (Hat(x) AND Own(P,x))

=> (A) is correct

 β„–17305157[Quote]

Option (F) I is ESL and are wonned

 β„–17305159[Quote]

Its just language shit

 β„–17305162[Quote]

A

 β„–17305168[Quote]

A is obvious because if he had 0 hats he'd also have 0 green hats and therefore all of his hats would be green, however we cannot conclude anything else

 β„–17305171[Quote]

WHICH ONE IS IT

 β„–17305176[Quote]

either A or D considering the hat in xis picture is green

 β„–17305178[Quote]

>>17305058 (OP)
abde
ez question geg

 β„–17305192[Quote]


 β„–17305196[Quote]

>>17305149
not hat, hats so it's always x>1 nusoi

 β„–17305198[Quote]

It can be multiple

 β„–17305200[Quote]

Not all my hats are green => has at least two hats, at least one of them is green

 β„–17305208[Quote]

>>17305196
When referring to the total of a group, even if that total is 1, you always say plural.

 β„–17305214[Quote]

File: 1783400605427n.gif πŸ“₯︎ (213.54 KB, 255x243) ImgOps

>Gather nusois and prove your logic skills

 β„–17305215[Quote]

@grok

 β„–17305242[Quote]

>>17305200
It doesn’t limit him to only two hats

 β„–17305249[Quote]

first sentence basically says the second one is false
there needs to be at least 1 non-green hat for statement 2 to be false

 β„–17305251[Quote]

>>17305208
a set of 1 is a singleton set, you don't refer to it in plural

 β„–17305254[Quote]

File: 1782515157755w.png πŸ“₯︎ (61.02 KB, 271x485) ImgOps

>>17305058 (OP)
>paradox
>look inside
>semantics

 β„–17305256[Quote]

>>17305242
I said at least nigger

 β„–17305276[Quote]

>>17305251
I guess, but that assumes xe's being open about the quantitative range of the set, which is unlikely. In which in that case, xe is referring to a set of an unknown quantity which is always plural.

 β„–17305287[Quote]

>>17305249
which pretty much means answer A

 β„–17305290[Quote]

I hate being a retard. i dont even know how to read this question.

 β„–17305296[Quote]

if he has no hats then it's a lie regardless of the color
If he does have hats It means at least one must NOT be green

 β„–17305303[Quote]

Brapsilien dialectics are one hell of a drug

 β„–17305355[Quote]

gemini says:
If he had NO hats: The statement "All my hats are green" would technically be a vacuous truth. In formal logic, any blanket statement made about an empty set is automatically considered true (e.g., "All my fire-breathing dragons are pink" is a true statement if I own zero dragons). Because Pinocchio is legally forbidden from telling the truth, he cannot have zero hats.

 β„–17305398[Quote]

I guess the negation of the allquantor is exists, so basically it is: there exists one hat that isnt green so A



[Return][Catalog][Go to top][Post a Reply]
Delete Post [ ]
[ home / overboard ] [ soy / qa / raid / r ] [ int / pol ] [ a / an / asp / biz / mtv / r9k / tech / v / sude / x ] [ q / news / chive / rules / pass / bans / status ] [ wiki ]