Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: SCI.LOGIC is a STAGNANT CESS PITT of LOSERS!
Replies: 3   Last Post: Nov 24, 2012 3:34 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Graham Cooper

Posts: 4,254
Registered: 5/20/10
SCI.LOGIC is a STAGNANT CESS PITT of LOSERS!
Posted: Nov 17, 2012 3:50 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

FROM AXIOMS you DERIVE THEOREMS!

Nobody CARES if SomeModel |= 'this is not derivable from your
axioms"

looks TRUE!

IT's not DERIVABLE FROM THE AXIOMS! END OF STORY!

Nothing Mathematically INCOMPLETE ABOUT IT!

LOGIC is an ARTS DEGREE on SLAGGING OFF COMPUTER PROGRAMMERS because
you PROVED YOURSELVES STUPID!

1 Godel proved LOGIC DOESNT WORK!
2 Everyone FELL FOR IT for 100 years
3 Literacy Students took up volumes of texts on logic

and Swamped any discussion with THAT WONT WORK because "TEACHER IS
RIGHT" arguments!

Any and All mathematical logicians posting to SCI.LOGIC have all been
verbally abused 100, 1000 times or more until they all left.

Me included.


******************


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)) ).



-----------------------

On Oct 31, 12:13 am, Gary Forbis wrote:
> -? wff(if(1,0))
> having found wff(X) :- t(X).
> wants to evaluate t(if(1,0)).
> having found t(if(X,Y)) :- if(X,Y).
> wants to evaluate if(1,0).
> having found if(X,Y) := t(X), t(Y).
> wants to evalueate t(1).
> Find t(1)
> RETURNS success.
> wants to evaluate t(0).
> RETURNS failure.
> wants to evaluate t(if(if(1,0),Y) :- if(if(1,0),Y)
> wants to evaluate if(1,0)
> ...


Only 1 other capable mathematical logician here!



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.