In case you’re curious about what the text behind the trollcat is (and because I’m inordinately proud of having composed such a cringeworthy piece of gibberish):
“My dear boy, while a sentence of a predicate logic may be a well formed formula with no free variables, a “sentence qua sentence” is viewed by most as requiring the expression of a proposition that makes an assertion concerning a fixed truth value with respect to the nominal structure of L!
In stark contrast, the truth value of a formula with free variables may very well be indeterminate with respect to any structure, and may range over several values which could be members of a universe, relations or functions, which themselves are concerned with variable truth value.
For example, a signature containing a constant symbol 0 for the number 0, a unary function symbol s for the successor function and a binary function symbol + for addition is necessarily closed. This ably demonstrates that a closed expression is not necessarily a ground expression, and therefore a ground formula is a closed formula, but not a ground formula, because it contains a logical variable, even though that variable is not free!”
*snigger* are you sure ur not HarryLyme on Twitter? JK! i’m so gonna link to this the next time he pokes me, hahahaha. TIA!
.-= slum_goddess´s last blog ..it’s Iron Mommy & stuff =-.
August 4th, 2009 at 5:36 pm
In case you’re curious about what the text behind the trollcat is (and because I’m inordinately proud of having composed such a cringeworthy piece of gibberish):
“My dear boy, while a sentence of a predicate logic may be a well formed formula with no free variables, a “sentence qua sentence” is viewed by most as requiring the expression of a proposition that makes an assertion concerning a fixed truth value with respect to the nominal structure of L!
In stark contrast, the truth value of a formula with free variables may very well be indeterminate with respect to any structure, and may range over several values which could be members of a universe, relations or functions, which themselves are concerned with variable truth value.
For example, a signature containing a constant symbol 0 for the number 0, a unary function symbol s for the successor function and a binary function symbol + for addition is necessarily closed. This ably demonstrates that a closed expression is not necessarily a ground expression, and therefore a ground formula is a closed formula, but not a ground formula, because it contains a logical variable, even though that variable is not free!”
August 9th, 2009 at 3:19 pm
Zzzzzzzz
December 5th, 2009 at 6:00 pm
when the dust settles u will be in a grant to have alot more people in the future see how creative u r
August 4th, 2009 at 5:57 pm
*snigger* are you sure ur not HarryLyme on Twitter? JK! i’m so gonna link to this the next time he pokes me, hahahaha. TIA!
.-= slum_goddess´s last blog ..it’s Iron Mommy & stuff =-.
August 4th, 2009 at 10:04 pm
genius cat is a genius
August 5th, 2009 at 9:05 am
The dialectic of troll is not antithetical to cat.
August 5th, 2009 at 10:36 pm
You lost me at “a fixed truth value with respect to the nominal structure of L!”
Which is probably not such a bad thing.
August 5th, 2009 at 11:40 pm
I lost myself much earlier. :/
August 7th, 2009 at 9:22 pm
i had to stop at “sentence qua sentence” haha nice one.
October 7th, 2009 at 8:29 pm
TL;DR BG dammit! *steals the nerd kitty*
March 11th, 2010 at 10:08 pm
You lost me at “while a sentence of predicate logic”.
Epic Trollcat is epic.
February 14th, 2011 at 3:39 am
tl;dnr