Oi! Townies...
From the 1950s Government Warnings challenge. See all 378 entries (closed)
( , Sat 16 Nov 2002, 18:37, archived)
From the 1950s Government Warnings challenge. See all 378 entries (closed)
( , Sat 16 Nov 2002, 18:37, archived)
I just
added b3ta to my favourites and it shows up as a little furtive icon :)
( ,
Sat 16 Nov 2002, 18:46,
archived)
ooh
so it does!
It`s set as my hompage so I`d never have noticed !
( ,
Sat 16 Nov 2002, 18:49,
archived)
It`s set as my hompage so I`d never have noticed !
i thought
you were just being different. or foreign. or something.
edit:
edit edit: to those below: i can't answer in a new message because i'm sitting back and relishing this number of posts for a while. woo! go rogan!
edit edit edit: thank you bananaman. though there are legions who would argue otherwise, i'll go with your assessment.
edit edit edit edit: stouffer! look down here! i can't reply to you without increasing my post count! but, yes, in his 1931 paper 'on formally undecidable propositions in principia mathematica and related systems I', i think it was.
edit edit edit edit edit: mystery_bob! look down here! no, he's not saying that nothing is provable. only that there are, provably, some things that are not provable.
edit edit edit edit edit edit: stouffer! look down here again!: something like
To every ω-consistent recursive class κ of formulae there correspond recursive class-signs r, such that neither vGenr nor Neg(vGenr) belongs to Flg(κ) (where v is the free variable of r).
right?
edit edit edit edit edit edit edit: dammit, they were omegas and kappas, by the way. now it doesn't make any sense.
edit edit edit edit edit edit edit edit: anyone know how i can get omegas and kappas in here using html entities? or is that impossible?
( ,
Sat 16 Nov 2002, 19:17,
archived)
edit:
edit edit: to those below: i can't answer in a new message because i'm sitting back and relishing this number of posts for a while. woo! go rogan!
edit edit edit: thank you bananaman. though there are legions who would argue otherwise, i'll go with your assessment.
edit edit edit edit: stouffer! look down here! i can't reply to you without increasing my post count! but, yes, in his 1931 paper 'on formally undecidable propositions in principia mathematica and related systems I', i think it was.
edit edit edit edit edit: mystery_bob! look down here! no, he's not saying that nothing is provable. only that there are, provably, some things that are not provable.
edit edit edit edit edit edit: stouffer! look down here again!: something like
To every ω-consistent recursive class κ of formulae there correspond recursive class-signs r, such that neither vGenr nor Neg(vGenr) belongs to Flg(κ) (where v is the free variable of r).
right?
edit edit edit edit edit edit edit: dammit, they were omegas and kappas, by the way. now it doesn't make any sense.
edit edit edit edit edit edit edit edit: anyone know how i can get omegas and kappas in here using html entities? or is that impossible?
actually
the ` is easier to find/reach than the '
whilst hummussing drunk.
Which is often.
( ,
Sat 16 Nov 2002, 19:21,
archived)
whilst hummussing drunk.
Which is often.
Doesn't do that in Opera
maybe I will have to bow to the pressures of Micro$oft.
NEVER!
( ,
Sat 16 Nov 2002, 18:52,
archived)
NEVER!