Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.math > #511799 > unrolled thread

***** DEFINITION OF PROOF ........... slightly different go Godels Defn ******

Started byGraham Cooper <grahamcooper7@gmail.com>
First post2021-02-09 23:09 -0800
Last post2021-02-11 00:05 -0800
Articles 9 — 3 participants

Back to article view | Back to sci.math


Contents

  ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Graham Cooper <grahamcooper7@gmail.com> - 2021-02-09 23:09 -0800
    Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Greta Baine <greta_turdberg@thewhack.net> - 2021-02-10 00:57 -0800
    Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Peter <peterxpercival@hotmail.com> - 2021-02-10 16:17 +0000
      Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Graham Cooper <grahamcooper7@gmail.com> - 2021-02-10 13:37 -0800
        Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Peter <peterxpercival@hotmail.com> - 2021-02-10 21:58 +0000
          Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Graham Cooper <grahamcooper7@gmail.com> - 2021-02-10 15:12 -0800
            Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Peter <peterxpercival@hotmail.com> - 2021-02-10 23:36 +0000
              Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Graham Cooper <grahamcooper7@gmail.com> - 2021-02-10 15:56 -0800
              Re: ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ****** Graham Cooper <grahamcooper7@gmail.com> - 2021-02-11 00:05 -0800

#511799 — ***** DEFINITION OF PROOF ........... slightly different go Godels Defn ******

FromGraham Cooper <grahamcooper7@gmail.com>
Date2021-02-09 23:09 -0800
Subject***** DEFINITION OF PROOF ........... slightly different go Godels Defn ******
Message-ID<55de6c9e-2d41-4eac-97eb-c41a46239af2n@googlegroups.com>
PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn )
<->
ALL( n )
AXIOM( Xn )
OR
EXIST( i ) EXIST ( j )
Xi AND Xj -> Xn

[toc] | [next] | [standalone]


#511802

FromGreta Baine <greta_turdberg@thewhack.net>
Date2021-02-10 00:57 -0800
Message-ID<s00757$23rh$1@neodome.net>
In reply to#511799
On 2/9/2021 11:09 PM, Graham Cooper wrote:
> PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn )

Get a brain.

[toc] | [prev] | [next] | [standalone]


#511836

FromPeter <peterxpercival@hotmail.com>
Date2021-02-10 16:17 +0000
Message-ID<s010u5$71m$1@gioia.aioe.org>
In reply to#511799
Graham Cooper wrote:
> PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn )
> <->
> ALL( n )
> AXIOM( Xn )
> OR
> EXIST( i ) EXIST ( j )
> Xi AND Xj -> Xn
> 

You clearly don't know what the definition of proof in a formal theory 
*is* (Gödel's, of course, is no different).  Why not read an 
introductory logic text and find out?

-- 
When, once, reference was made to a statesman almost universally
recognized as one of the villains of this century, in order to
induce him to a negative judgment, he replied: "My situation is
so different from his, that it is not for me to pass judgment".
Ernst Specker on Paul Bernays

[toc] | [prev] | [next] | [standalone]


#511865

FromGraham Cooper <grahamcooper7@gmail.com>
Date2021-02-10 13:37 -0800
Message-ID<758e4885-4428-4705-b459-f8dfcc73bbc6n@googlegroups.com>
In reply to#511836
On Thursday, February 11, 2021 at 3:17:21 AM UTC+11, Peter wrote:
> Graham Cooper wrote: 
> > PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn ) 
> > <-> 
> > ALL( n ) 
> > AXIOM( Xn ) 
> > OR 
> > EXIST( i ) EXIST ( j ) 
> > Xi AND Xj -> Xn 
> >
> You clearly don't know what the definition of proof in a formal theory 


Using this defn of PROOF ...  a proof is a THEOREM  (not in GODELS its a CON SEQUENCE)



There is a FORMAL PROVER i programmed at

www.LOG1K.com

CLICK [START] [SOLVER 1] [DO IMPLY] [DO IMPLY]




goal and 1 1 top goal 1 
fact and 1 1 top goal 1 
truth and 1 1 false 
  
fact or 2 1 isnum zN 0 
fact or 3 1 e zN odds 
fact or 3 2 e zN evens 

factimp or 2 and 1 1 
factimp or 3 or 2 1 
 
axiom 1 f a b 
axiom 2 e 1 odds 
axiom 3 e 2 evens 
axiom 4 e 3 odds 
 
equals zN 2 



The above is the FORMAL SYSTEM LOGIC

isnum(N) <- NeODDS OR NeEVENS

N = 2

AXIOM:  1 e ODDS
AXIOM:  2 e EVENS


Can you deduce the value of TOP(GOAL) ?


IF NOT, just look at the PIC and tell me WHY its not a formal system?


**********   www.LOG1K.com/CYBER-LOGIC.png ******












[toc] | [prev] | [next] | [standalone]


#511867

FromPeter <peterxpercival@hotmail.com>
Date2021-02-10 21:58 +0000
Message-ID<s01kuh$8n1$1@gioia.aioe.org>
In reply to#511865
Graham Cooper wrote:
> On Thursday, February 11, 2021 at 3:17:21 AM UTC+11, Peter wrote:
>> Graham Cooper wrote:
>>> PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn )
>>> <->
>>> ALL( n )
>>> AXIOM( Xn )
>>> OR
>>> EXIST( i ) EXIST ( j )
>>> Xi AND Xj -> Xn
>>>
>> You clearly don't know what the definition of proof in a formal theory
> 
> 
> Using this defn of PROOF ...  a proof is a THEOREM

That's your definition.  Frame your own definitions of familiar terms 
and you can claim anything you like.  I define "blue" to mean red - all 
of a sudden I drive a blue car.


>  (not in GODELS its a CON SEQUENCE)
> 
> 
> 
> There is a FORMAL PROVER i programmed at
> 
> www.LOG1K.com
> 
> CLICK [START] [SOLVER 1] [DO IMPLY] [DO IMPLY]
> 
> 
> 
> 
> goal and 1 1 top goal 1
> fact and 1 1 top goal 1
> truth and 1 1 false
>    
> fact or 2 1 isnum zN 0
> fact or 3 1 e zN odds
> fact or 3 2 e zN evens
> 
> factimp or 2 and 1 1
> factimp or 3 or 2 1
>   
> axiom 1 f a b
> axiom 2 e 1 odds
> axiom 3 e 2 evens
> axiom 4 e 3 odds
>   
> equals zN 2
> 
> 
> 
> The above is the FORMAL SYSTEM LOGIC
> 
> isnum(N) <- NeODDS OR NeEVENS
> 
> N = 2
> 
> AXIOM:  1 e ODDS
> AXIOM:  2 e EVENS
> 
> 
> Can you deduce the value of TOP(GOAL) ?
> 
> 
> IF NOT, just look at the PIC and tell me WHY its not a formal system?
> 
> 
> **********   www.LOG1K.com/CYBER-LOGIC.png ******
> 
> 
> 
> 
> 
> 
> 
> 
> 
> 
> 
> 
> 


-- 
When, once, reference was made to a statesman almost universally
recognized as one of the villains of this century, in order to
induce him to a negative judgment, he replied: "My situation is
so different from his, that it is not for me to pass judgment".
Ernst Specker on Paul Bernays

[toc] | [prev] | [next] | [standalone]


#511871

FromGraham Cooper <grahamcooper7@gmail.com>
Date2021-02-10 15:12 -0800
Message-ID<9777792d-ca0a-486f-acfb-d5b0c67194cfn@googlegroups.com>
In reply to#511867
On Thursday, February 11, 2021 at 8:58:52 AM UTC+11, Peter wrote:
> Graham Cooper wrote: 
> > On Thursday, February 11, 2021 at 3:17:21 AM UTC+11, Peter wrote: 
> >> Graham Cooper wrote: 
> >>> PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn ) 
> >>> <-> 
> >>> ALL( n ) 
> >>> AXIOM( Xn ) 
> >>> OR 
> >>> EXIST( i ) EXIST ( j ) 
> >>> Xi AND Xj -> Xn 
> >>> 
> >> You clearly don't know what the definition of proof in a formal theory 
> > 
> > 
> > Using this defn of PROOF ... a proof is a THEOREM
> That's your definition. Frame your own definitions of familiar terms 
> and you can claim anything you like. I define "blue" to mean red - all 
> of a sudden I drive a blue car.
> > (not in GODELS its a CON SEQUENCE) 


 ********** www.LOG1K.com/CYBER-LOGIC.png ****** 


You make an odd objection to the given defn of PROOF

its backwards compatible with godels defn but much simpler

In this SYSTEM

T|- Ep proof(p,X)

->

T|-p

T+X  <->  p     //  given X does not form a contradiction

I have given a simple way to ENUMERATE THEOREMS so my system is formal although lacks quantifiers and NOT




[toc] | [prev] | [next] | [standalone]


#511872

FromPeter <peterxpercival@hotmail.com>
Date2021-02-10 23:36 +0000
Message-ID<s01qmp$ch9$1@gioia.aioe.org>
In reply to#511871
Graham Cooper wrote:
> On Thursday, February 11, 2021 at 8:58:52 AM UTC+11, Peter wrote:
>> Graham Cooper wrote:
>>> On Thursday, February 11, 2021 at 3:17:21 AM UTC+11, Peter wrote:
>>>> Graham Cooper wrote:
>>>>> PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn )
>>>>> <->
>>>>> ALL( n )
>>>>> AXIOM( Xn )
>>>>> OR
>>>>> EXIST( i ) EXIST ( j )
>>>>> Xi AND Xj -> Xn
>>>>>
>>>> You clearly don't know what the definition of proof in a formal theory
>>>
>>>
>>> Using this defn of PROOF ... a proof is a THEOREM
>> That's your definition. Frame your own definitions of familiar terms
>> and you can claim anything you like. I define "blue" to mean red - all
>> of a sudden I drive a blue car.
>>> (not in GODELS its a CON SEQUENCE)
> 
> 
>   ********** www.LOG1K.com/CYBER-LOGIC.png ******
> 
> 
> You make an odd objection to the given defn of PROOF

You have given no definition!

> its backwards compatible with godels defn but much simpler
> 
> In this SYSTEM
> 
> T|- Ep proof(p,X)
> 
> ->
> 
> T|-p
> 
> T+X  <->  p     //  given X does not form a contradiction
> 
> I have given a simple way to ENUMERATE THEOREMS so my system is formal although lacks quantifiers and NOT

If it lacks NOT then it has nothing to say about Gödel.  Ditto 
quantifiers, but I mention NOT because S.W.P. Steen in /Mathematical 
Logic with Special Reference to the Natural Numbers/ (CUP, 1972) has 
defined various theories of arithmetic.  One of them (he calls it 
A_{oo}) is complete and decidable.  Another (A_o) is complete and 
undecidable.  How is this possible?, I hear you ask.  By having negation 
in his underlying logic being non-standard, that's how.  Steen's work is 
closely related to that of Fitch, Myhill and Löb.

No quantifiers?  Isn't that like not being allowed to have butter on 
your bread?

-- 
When, once, reference was made to a statesman almost universally
recognized as one of the villains of this century, in order to
induce him to a negative judgment, he replied: "My situation is
so different from his, that it is not for me to pass judgment".
Ernst Specker on Paul Bernays

[toc] | [prev] | [next] | [standalone]


#511873

FromGraham Cooper <grahamcooper7@gmail.com>
Date2021-02-10 15:56 -0800
Message-ID<42988766-f7ff-4221-920c-725434a9e346n@googlegroups.com>
In reply to#511872
On Thursday, February 11, 2021 at 10:37:09 AM UTC+11, Peter wrote:
> Graham Cooper wrote: 
> > On Thursday, February 11, 2021 at 8:58:52 AM UTC+11, Peter wrote: 
> >> Graham Cooper wrote: 
> >>> On Thursday, February 11, 2021 at 3:17:21 AM UTC+11, Peter wrote: 
> >>>> Graham Cooper wrote: 
> >>>>> PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn ) 
> >>>>> <-> 
> >>>>> ALL( n ) 
> >>>>> AXIOM( Xn ) 
> >>>>> OR 
> >>>>> EXIST( i ) EXIST ( j ) 
> >>>>> Xi AND Xj -> Xn 
> >>>>> 
> >>>> You clearly don't know what the definition of proof in a formal theory 
> >>> 
> >>> 
> >>> Using this defn of PROOF ... a proof is a THEOREM 
> >> That's your definition. Frame your own definitions of familiar terms 
> >> and you can claim anything you like. I define "blue" to mean red - all 
> >> of a sudden I drive a blue car. 
> >>> (not in GODELS its a CON SEQUENCE) 
> > 
> > 
> > ********** www.LOG1K.com/CYBER-LOGIC.png ****** 
> > 
> > 
> > You make an odd objection to the given defn of PROOF
> You have given no definition!
> > its backwards compatible with godels defn but much simpler 
> > 
> > In this SYSTEM 
> > 
> > T|- Ep proof(p,X) 
> > 
> > -> 
> > 
> > T|-p 
> > 
> > T+X <-> p // given X does not form a contradiction 
> > 
> > I have given a simple way to ENUMERATE THEOREMS so my system is formal although lacks quantifiers and NOT
> If it lacks NOT then it has nothing to say about Gödel. Ditto 
> quantifiers, but I mention NOT because S.W.P. Steen in /Mathematical 
> Logic with Special Reference to the Natural Numbers/ (CUP, 1972) has 
> defined various theories of arithmetic. One of them (he calls it 
> A_{oo}) is complete and decidable. Another (A_o) is complete and 
> undecidable. How is this possible?, I hear you ask. By having negation 
> in his underlying logic being non-standard, that's how. Steen's work is 
> closely related to that of Fitch, Myhill and Löb. 
> 
> No quantifiers? Isn't that like not being allowed to have butter on 
> your bread?


Its a simple logic

a AND b AND c -> d
a OR b OR c -> d

So far it solves

PATH(A C)
<- RD(A B)
AND RD(B C)

ISNUM(N)
<- N e ODDS
OR N e EVENS


You can SEE the 2nd branch NeEVENS in the 2nd ROW !

www.log1k.com/CYBER-LOGIC.png


[toc] | [prev] | [next] | [standalone]


#511891

FromGraham Cooper <grahamcooper7@gmail.com>
Date2021-02-11 00:05 -0800
Message-ID<602dbad5-b782-41b9-9cb9-0d778c3f0f5en@googlegroups.com>
In reply to#511872
On Thursday, February 11, 2021 at 10:37:09 AM UTC+11, Peter wrote:
> Graham Cooper wrote: 
> > On Thursday, February 11, 2021 at 8:58:52 AM UTC+11, Peter wrote: 
> >> Graham Cooper wrote: 
> >>> On Thursday, February 11, 2021 at 3:17:21 AM UTC+11, Peter wrote: 
> >>>> Graham Cooper wrote: 
> >>>>> PROOF( <X1 AND X2 AND X3 AND .. Xn> , Xn ) 
> >>>>> <-> 
> >>>>> ALL( n ) 
> >>>>> AXIOM( Xn ) 
> >>>>> OR 
> >>>>> EXIST( i ) EXIST ( j ) 
> >>>>> Xi AND Xj -> Xn 
> >>>>> 
> >>>> You clearly don't know what the definition of proof in a formal theory 
> >>> 
> >>> 
> >>> Using this defn of PROOF ... a proof is a THEOREM 
> >> That's your definition. Frame your own definitions of familiar terms 
> >> and you can claim anything you like. I define "blue" to mean red - all 
> >> of a sudden I drive a blue car. 
> >>> (not in GODELS its a CON SEQUENCE) 
> > 
> > 
> > ********** www.LOG1K.com/CYBER-LOGIC.png ****** 
> > 
> > 
> > You make an odd objection to the given defn of PROOF
> You have given no definition!
> > its backwards compatible with godels defn but much simpler 
> > 
> > In this SYSTEM 
> > 
> > T|- Ep proof(p,X) 
> > 
> > -> 
> > 
> > T|-p 
> > 
> > T+X <-> p // given X does not form a contradiction 
> > 
> > I have given a simple way to ENUMERATE THEOREMS so my system is formal although lacks quantifiers and NOT
> If it lacks NOT then it has nothing to say about Gödel. Ditto 
> quantifiers, but I mention NOT because S.W.P. Steen in /Mathematical 
> Logic with Special Reference to the Natural Numbers/ (CUP, 1972) has 
> defined various theories of arithmetic. One of them (he calls it 
> A_{oo}) is complete and decidable. Another (A_o) is complete and 
> undecidable. How is this possible?, I hear you ask. By having negation 
> in his underlying logic being non-standard,


I devised a non-standard negation

neg(blue red)
neg(red green)

negg( red ) ?

blue
green

negg( negg( blue ))  [?]
negg( { red green } )

blue 
green
blue
red

no negg(negg(blue)) is not blue





[toc] | [prev] | [standalone]


Back to top | Article view | sci.math


csiph-web