
Re: logical inference
Posted:
Nov 17, 2012 3:23 AM


On Nov 17, 5:40 pm, Marshall <marshall.spi...@gmail.com> wrote: > On Friday, November 16, 2012 2:30:12 PM UTC8, Aatu Koskensilta wrote: > > > He's insane. It's difficult to say whether he's also an idiot. > > Stupid comes in many flavors. > > Marshall > >
YOU'RE ALL INCESSANT ASSHOLES!
Not ONE POSTER IN SCI.LOGIC has any actual mathematical ability!
LOGIC is a DEGRADED ARTS STUDY by MORONS doing LITERARY EXERCISE who can QUOTE LITERATURE.
LOGIC as it is peddled in SCI.LOGIC is no different to LAW, CITING LAW ARTICLES, ANCIENT HISTORY, LATIN, ANY STUDY OF LITERATURE where any STUDIOUS MORON with 0 UNDERSTANDING, 0 MATHS ABILITY, and a memory for KEYWORDS can excel by QUOTING LITERATURE AD INFINITUM.
NONE OF YOU HAVE POSTED A SINGLE MATHS FORMULA WITH LOGIC IN IT in the 10 YEARS I'VE POSTED HERE!
I write 100 LINES OF LOGIC FORMULA A WEEK HERE.
NONE OF YOU ARE CAPABLE OF READING LOGIC, WRITING LOGIC, USING LOGIC, or ARGUING LOGIC CORRECTLY.
NONE of you can DO ANY MATHS PERIOD!
All of you could have just as well done a LAW DEGREE using the SAME LITERACY SKILLS that you peddle here as MATHEMATICAL KNOWLEDGE.
YOU"RE ALL STUPID, INCAPABLE OF LISTENING TO ANY ARGUMENT AT ALL!
ALL YOUR THEORIES ARE GOING OUT THE WINDOW ONE BY ONE.
All the topics and stances are slowly morphing more and more to EVERYTHING I have written here previously. It just takes you all 6 months to 2 years TO FOLLOW ONE OF MY POSTS because none of you have the brains to understand ANYTHING LOGICAL on your own, only by group dissemination over a period of peer checking if some assertion is allowed or not.
You're all POMPOUS IDIOTS who think by STUDYING 20TH CENTURY LOGIC you gain membership to a HIGH CLASS OF CITIZEN, you all act like you are superior and infallible by quoting articles.
You're all ARTS DEGREES MAJORS IN DISGUISE!
LITERACY KNOWITALLS reading an obselete moronic theory that justifies your lack of computing and formal logic know how.
misc.writing added so all the regular text book quoters here feel at home.
Herc  www.microPROLOG.com
A FORMAL SYSTEM WRITTEN PURELY IN PREDICATES!
f(0). t(1). t(X) : f(f(X)). wff(X) : t(X). wff(X) : f(X). what(X,true) : t(X). what(X,false) : f(X).
t(if(X,Y)) : t(X), t(Y). t(if(X,Y)) : f(X), f(Y). t(if(X,Y)) : f(X), t(Y). t(or(X,Y)) : t(X). t(or(X,Y)) : t(Y). t(and(X,Y)) : t(X),t(Y). t(iff(X,Y)) : t(X),t(Y). t(iff(X,Y)) : f(X),f(Y). t(xor(X,Y)) : t(X),f(Y). t(xor(X,Y)) : f(X),t(Y). f(if(X,Y)) : t(X),f(Y). f(or(X,Y)) : f(X),f(Y). f(and(X,Y)) : f(X). f(and(X,Y)) : f(Y). f(iff(X,Y)) : t(X),f(Y). f(iff(X,Y)) : f(X),t(Y). f(xor(X,Y)) : t(X),t(Y). f(xor(X,Y)) : f(X),f(Y).
RESOLUTION or(R,Q) : if(L,R), or(L,Q). or(R,Q) : if(L,R), or(Q,L). or(Q,R) : if(L,R), or(L,Q). or(Q,R) : if(L,R), or(Q,L).
MODUS PONENS t(R) : if(L,R), t(L). t(R) : or(f(L),R), t(L). t(R) : or(R,f(L)), t(L).
INFERENCE RULES if( if(t(S),f(R)) , if(t(R),f(S)) ).

