Tilted Forum Project Discussion Community - View Single Post

CSflim · 03-20-2006, 10:31 AM

Ok, I get it now. It's basically a pseudo-mathematical statement of Pascal's Wager.

Remember kids:

Rule 1: If your unconvincing old-hat argument doesn't seem to cut the mustard: throw in a boat load of formal symbols and mathematic notation. Notation means its logically water-tight, and thoroughly profound. A major improvement.[^1]

Rule 2: If your argument is so muddled and unclearly stated that nobody can follow it; you win! Your argument is so deep that nobody can hope to understand it, much less refute it!

[1]: Let Q be a function, Q: A -> R, where A is the set of arguments, where an argument is an ordered list of words, and R is the set of real numbers. We state an ordered list of words a1, such that Q(a1) = q. Next we define a function F where F: A -> A. F uniquely maps each word w, in the ordered list of words a1, to a subset of W; SL where SL is defined as S U L, (the set of symbols union the set of letters).
Q(a1) < Q(F(a1)) for all a1 є W.
Q.E.D.

03-20-2006, 10:31 AM	#10 (permalink)
CSflim Sky Piercer Location: Ireland	Ok, I get it now. It's basically a pseudo-mathematical statement of Pascal's Wager. Remember kids: Rule 1: If your unconvincing old-hat argument doesn't seem to cut the mustard: throw in a boat load of formal symbols and mathematic notation. Notation means its logically water-tight, and thoroughly profound. A major improvement.[^1] Rule 2: If your argument is so muddled and unclearly stated that nobody can follow it; you win! Your argument is so deep that nobody can hope to understand it, much less refute it! [1]: Let Q be a function, Q: A -> R, where A is the set of arguments, where an argument is an ordered list of words, and R is the set of real numbers. We state an ordered list of words a1, such that Q(a1) = q. Next we define a function F where F: A -> A. F uniquely maps each word w, in the ordered list of words a1, to a subset of W; SL where SL is defined as S U L, (the set of symbols union the set of letters). Q(a1) < Q(F(a1)) for all a1 є W. Q.E.D. __________________ Last edited by CSflim; 03-20-2006 at 12:27 PM.. Reason: slight calculation mistake in my formal derivation.