Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #165940 > unrolled thread
| Started by | George Greene <greeneg@email.unc.edu> |
|---|---|
| First post | 2017-10-29 06:43 -0700 |
| Last post | 2017-11-21 13:59 -0800 |
| Articles | 20 — 5 participants |
Back to article view | Back to sci.logic
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: True(x) ↔ ∃y Provable(y, x) George Greene <greeneg@email.unc.edu> - 2017-10-29 06:43 -0700
Re: True(x) ↔ ∃y Provable(y, x) Peter Percival <peterxpercival@hotmail.com> - 2017-10-29 14:35 +0000
Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) Pete Olcott <Pete@NoEmail.address> - 2017-10-31 17:21 -0500
Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) Peter Percival <peterxpercival@hotmail.com> - 2017-10-31 22:43 +0000
Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) Peter Percival <peterxpercival@hotmail.com> - 2017-10-31 22:49 +0000
Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) Pete Olcott <Pete@NoEmail.address> - 2017-10-31 18:25 -0500
Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) Peter Percival <peterxpercival@hotmail.com> - 2017-10-31 23:47 +0000
Re: True(x) ↔ ∃y Provable(y, x) Pete Olcott <Pete@NoEmail.address> - 2017-10-31 19:03 -0500
Re: True(x) ↔ ∃y Provable(y, x) Peter Percival <peterxpercival@hotmail.com> - 2017-11-01 00:24 +0000
Re: True(x) ↔ ∃y Provable(y, x) Pete Olcott <Pete@NoEmail.address> - 2017-10-31 23:49 -0500
Re: True(x) ↔ ∃y Provable(y, x) Jim Burns <james.g.burns@att.net> - 2017-11-01 09:59 -0400
Re: True(x) ↔ ∃y Provable(y, x) Peter Percival <peterxpercival@hotmail.com> - 2017-11-03 19:05 +0000
Re: True(x) ↔ ∃y Provable(y, x) Pete Olcott <Pete@NoEmail.address> - 2017-11-02 14:22 -0500
Re: True(x) ↔ ∃y Provable(y, x) Peter Percival <peterxpercival@hotmail.com> - 2017-11-02 19:52 +0000
Re: True(x) ↔ ∃y Provable(y, x) Peter Percival <peterxpercival@hotmail.com> - 2017-11-03 14:13 +0000
Re: True(x) ↔ ∃y Provable(y, x) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-02 20:10 +0000
Re: True(x) ↔ ∃y Provable(y, x) George Greene <greeneg@email.unc.edu> - 2017-11-21 13:57 -0800
Re: True(x) ↔ ∃y Provable(y, x) Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 22:39 +0000
Re: True(x) ↔ ∃y Provable(y, x) Peter Percival <peterxpercival@hotmail.com> - 2017-11-22 13:44 +0000
Re: True(x) ↔ ∃y Provable(y, x) George Greene <greeneg@email.unc.edu> - 2017-11-21 13:59 -0800
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-10-29 06:43 -0700 |
| Subject | Re: True(x) ↔ ∃y Provable(y, x) |
| Message-ID | <7e8d6310-1513-4c42-a45a-2ecb9518ab00@googlegroups.com> |
On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
> The above formula is ultimate foundation of my refutation of the:
> {1931 GIT, Halting Problem proof, Liar Paradox}.
>
> The above formula says that True(X) is entirely defined by
> Provable(X).
You can say that if you like,but your "above formula" DOESN'T say that.
your above formula says that True(X) is entirely defined by Ey[Provable(Y,X)].
It does NOT say that True(X) is entirely defined by Provable(X).
The "-able" suffix is translated by the existential quantifier.
ProvABLE(x) MEANS Ey[PROVES(y,x).
An INDIVIDUAL sentence may be or not be provable -- provable is a UNARY predicate. If a sentence x is provable, then it has A PROOF, y, and the
foundation of your unary predicate is THE BINARY predicate that holds between
y and x when y is A PROOF OF x, when y proves x.
In other words, THE TITLE of your thread IS ALREADY *ERRONEOUS* -- according to what YOU were trying (and unfortunately failing) to say, so it is hard to take any of the rest of it seriously; everybody can see up front that you're stupid.
[toc] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-10-29 14:35 +0000 |
| Message-ID | <ot4ovb$he7$1@news.albasani.net> |
| In reply to | #165940 |
George Greene wrote:
> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>> The above formula is ultimate foundation of my refutation of the:
>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>
>> The above formula says that True(X) is entirely defined by
>> Provable(X).
I don't know where the first post to this thread is, so I'm jumping in
to the middle.
About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean
by "Provable"?
--
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess. Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-10-31 17:21 -0500 |
| Subject | Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) |
| Message-ID | <La-dnVkroebWamXEnZ2dnUU7-TXNnZ2d@giganews.com> |
| In reply to | #165944 |
On 10/31/2017 4:04 PM, Pete Olcott wrote: > http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/ > > Provable explained in using conventional notation: > https://en.wikipedia.org/wiki/Logical_consequence#Syntactic_consequence > > A formula */A/* is a syntactic consequence within some formal system */FS/* of a set *Γ* of formulas if there is a formal proof in */FS/* of A from the set *Γ*. > *Provable**_FS **(Γ, A) ---* > > In other words: Formula A is Provable within Formal System FS if there exists an inference chain (connected sequence of WFF) from a set of Formula Γ to Formula A. > > Furthermore if Γ are axioms of FS, then Provable(Γ, A) ≡ True(A) in FS: > *True**_FS **(A) ≡ Provable**_FS **(Γ, A)* --- > *False**_FS **(A) ≡ Provable**_FS **(Γ, ~A) *--- > > Last paragraph copyright 2017 Pete Olcott All of the _FS shown above are supposed to be subscripts. -- Defining Tarski’s ∀x True(x) ↔ φ(x) True(x) ↔ ∃y Provable(y, x)
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-10-31 22:43 +0000 |
| Subject | Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) |
| Message-ID | <otauas$k6u$1@news.albasani.net> |
| In reply to | #166066 |
Pete Olcott wrote: > On 10/31/2017 4:04 PM, Pete Olcott wrote: >> http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/ >> >> Provable explained in using conventional notation: >> https://en.wikipedia.org/wiki/Logical_consequence#Syntactic_consequence >> >> A formula */A/* is a syntactic consequence within some formal system >> */FS/* of a set *Γ* of formulas if there is a formal proof in */FS/* >> of A from the set *Γ*. >> *Provable**_FS **(Γ, A) ---* >> >> In other words: Formula A is Provable within Formal System FS if there >> exists an inference chain (connected sequence of WFF) Connected how? >> from a set of >> Formula Γ to Formula A. >> >> Furthermore if Γ are axioms of FS, then Provable(Γ, A) ≡ True(A) in FS: >> *True**_FS **(A) ≡ Provable**_FS **(Γ, A)* --- >> *False**_FS **(A) ≡ Provable**_FS **(Γ, ~A) *--- >> >> Last paragraph copyright 2017 Pete Olcott > > All of the _FS shown above are supposed to be subscripts. > -- Do, as a concession to my poor wits, Lord Darlington, just explain to me what you really mean. I think I had better not, Duchess. Nowadays to be intelligible is to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-10-31 22:49 +0000 |
| Subject | Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) |
| Message-ID | <otaulv$k6u$3@news.albasani.net> |
| In reply to | #166066 |
Pete Olcott wrote: > On 10/31/2017 4:04 PM, Pete Olcott wrote: >> http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/ >> >> Provable explained in using conventional notation: >> https://en.wikipedia.org/wiki/Logical_consequence#Syntactic_consequence >> >> A formula */A/* is a syntactic consequence within some formal system >> */FS/* of a set *Γ* of formulas if there is a formal proof in */FS/* >> of A from the set *Γ*. >> *Provable**_FS **(Γ, A) ---* >> >> In other words: Formula A is Provable within Formal System FS if there >> exists an inference chain (connected sequence of WFF) from a set of >> Formula Γ to Formula A. >> >> Furthermore if Γ are axioms of FS, then Provable(Γ, A) ≡ True(A) in FS: >> *True**_FS **(A) ≡ Provable**_FS **(Γ, A)* --- >> *False**_FS **(A) ≡ Provable**_FS **(Γ, ~A) *--- >> >> Last paragraph copyright 2017 Pete Olcott > > All of the _FS shown above are supposed to be subscripts. > As far as I can make out that makes everything true. I say "as far as I can make out" because your "better formatting" has made your text just about unreadable. -- Do, as a concession to my poor wits, Lord Darlington, just explain to me what you really mean. I think I had better not, Duchess. Nowadays to be intelligible is to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-10-31 18:25 -0500 |
| Subject | Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) |
| Message-ID | <-_KdneP2KZ7_m2TEnZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #166068 |
On 10/31/2017 5:49 PM, Peter Percival wrote: > Pete Olcott wrote: >> On 10/31/2017 4:04 PM, Pete Olcott wrote: >>> http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/ >>> >>> Provable explained in using conventional notation: >>> https://en.wikipedia.org/wiki/Logical_consequence#Syntactic_consequence >>> >>> A formula */A/* is a syntactic consequence within some formal system >>> */FS/* of a set *Γ* of formulas if there is a formal proof in */FS/* >>> of A from the set *Γ*. >>> *Provable**_FS **(Γ, A) ---* >>> >>> In other words: Formula A is Provable within Formal System FS if there >>> exists an inference chain (connected sequence of WFF) from a set of >>> Formula Γ to Formula A. >>> >>> Furthermore if Γ are axioms of FS, then Provable(Γ, A) ≡ True(A) in FS: >>> *True**_FS **(A) ≡ Provable**_FS **(Γ, A)* --- >>> *False**_FS **(A) ≡ Provable**_FS **(Γ, ~A) *--- >>> >>> Last paragraph copyright 2017 Pete Olcott >> >> All of the _FS shown above are supposed to be subscripts. >> > As far as I can make out that makes everything true. I say "as far as I can make out" because your "better formatting" has made your text just about unreadable. > > I made about four different versions of this response to you, go back to the earlier ones in a browser to see them in HTML. The 10:24 AM one displays formatting correctly in Chrome and Edge. The 3:27 PM one displays correctly except for the subscripting of FS. I have spent about six hours today so far just answering your one post. I write the answer and then revise it several dozen times. Here is my website version of the answer to your post: http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/ -- Defining Tarski’s ∀x True(x) ↔ φ(x) True(x) ↔ ∃y Provable(y, x)
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-10-31 23:47 +0000 |
| Subject | Re: True(x) ↔ ∃y Provable(y, x) (conventional notation) (better formatting) |
| Message-ID | <otb21r$bq1$1@news.albasani.net> |
| In reply to | #166070 |
Pete Olcott wrote: > Here is my website version of the answer to your post: It isn't a reply. It's a repetition of the error. > http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/ > -- Do, as a concession to my poor wits, Lord Darlington, just explain to me what you really mean. I think I had better not, Duchess. Nowadays to be intelligible is to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-10-31 19:03 -0500 |
| Message-ID | <QYSdnW35F7LzkmTEnZ2dnUU7-K3NnZ2d@giganews.com> |
| In reply to | #165944 |
On 10/29/2017 9:35 AM, Peter Percival wrote:
> George Greene wrote:
>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>> The above formula is ultimate foundation of my refutation of the:
>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>
>>> The above formula says that True(X) is entirely defined by
>>> Provable(X).
>
> I don't know where the first post to this thread is, so I'm jumping in to the middle.
>
> About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean by "Provable"?
>
>
http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/
I mean exactly the same thing as the Wikipedia link that I have referenced and quoted on the above link, except that my Γ only includes WFF that are axioms.
--
Defining Tarski’s ∀x True(x) ↔ φ(x)
True(x) ↔ ∃y Provable(y, x)
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-11-01 00:24 +0000 |
| Message-ID | <otb47a$5eq$1@news.albasani.net> |
| In reply to | #166072 |
Pete Olcott wrote:
> On 10/29/2017 9:35 AM, Peter Percival wrote:
>> George Greene wrote:
>>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>>> The above formula is ultimate foundation of my refutation of the:
>>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>>
>>>> The above formula says that True(X) is entirely defined by
>>>> Provable(X).
>>
>> I don't know where the first post to this thread is, so I'm jumping in
>> to the middle.
>>
>> About your True(x) ↔ ∃y Provable(y, x), could you outline what you
>> mean by "Provable"?
>>
>>
>
> http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/
>
> I mean exactly the same thing as the Wikipedia link that I have
> referenced and quoted on the above link, except that my Γ only includes
> WFF that are axioms.
>
How do you choose your axioms?
--
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess. Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-10-31 23:49 -0500 |
| Message-ID | <9d6dnTpMOIfpz2TEnZ2dnUU7-IXNnZ2d@giganews.com> |
| In reply to | #166076 |
On 10/31/2017 7:24 PM, Peter Percival wrote:
> Pete Olcott wrote:
>> On 10/29/2017 9:35 AM, Peter Percival wrote:
>>> George Greene wrote:
>>>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>>>> The above formula is ultimate foundation of my refutation of the:
>>>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>>>
>>>>> The above formula says that True(X) is entirely defined by
>>>>> Provable(X).
>>>
>>> I don't know where the first post to this thread is, so I'm jumping in
>>> to the middle.
>>>
>>> About your True(x) ↔ ∃y Provable(y, x), could you outline what you
>>> mean by "Provable"?
>>>
>>>
>>
>> http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/
>>
>> I mean exactly the same thing as the Wikipedia link that I have
>> referenced and quoted on the above link, except that my Γ only includes
>> WFF that are axioms.
>>
> How do you choose your axioms?
>
>
https://en.wikipedia.org/wiki/Formalism_(philosophy_of_mathematics)
Axioms are not chosen they are constructed as the encoding of relations using finite strings.
The encoded relations specify edges between nodes of a directed acyclic graph.
--
Defining Tarski’s ∀x True(x) ↔ φ(x)
True(x) ↔ ∃y Provable(y, x)
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2017-11-01 09:59 -0400 |
| Message-ID | <1937f285-3660-ee6c-1a2b-4b855f48ae50@att.net> |
| In reply to | #166082 |
On 11/1/2017 12:49 AM, Pete Olcott wrote:
> On 10/31/2017 7:24 PM, Peter Percival wrote:
>> Pete Olcott wrote:
>>> On 10/29/2017 9:35 AM, Peter Percival wrote:
>>>> About your True(x) ↔ ∃y Provable(y, x), could you outline
>>>> what you mean by "Provable"?
>>>
>>> http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/
>>>
>>> I mean exactly the same thing as the Wikipedia link that
>>> I have referenced and quoted on the above link, except
>>> that my Γ only includes WFF that are axioms.
@Olcott
Please say something more than "exactly the same".
Your history shows that you are not very good at figuring
out what text like that means. _What do you think_
"exactly the same" is?
>> How do you choose your axioms?
>
> https://en.wikipedia.org/wiki/Formalism_(philosophy_of_mathematics)
This doesn't appear to have anything to do with how you
choose your axioms.
> Axioms are not chosen they are constructed as the encoding
> of relations using finite strings.
> The encoded relations specify edges between nodes of
> a directed acyclic graph.
The (potential) axiom 3 > 5 we're discussing
-- is the encoding of a relation using finite strings
-- can be specified using an acyclic graph.
So, you haven't yet given a reason that
{3 > 5} |- 3 > 5
_does not_ imply that 3 > 5 is true, according to your
definition.
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-11-03 19:05 +0000 |
| Message-ID | <otiel2$550$1@news.albasani.net> |
| In reply to | #166082 |
Pete Olcott wrote:
> On 10/31/2017 7:24 PM, Peter Percival wrote:
>> Pete Olcott wrote:
>>> On 10/29/2017 9:35 AM, Peter Percival wrote:
>>>> George Greene wrote:
>>>>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete
>>>>> Olcott wrote:
>>>>>> The above formula is ultimate foundation of my refutation
>>>>>> of the: {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>>>>
>>>>>> The above formula says that True(X) is entirely defined by
>>>>>> Provable(X).
>>>>
>>>> I don't know where the first post to this thread is, so I'm
>>>> jumping in to the middle.
>>>>
>>>> About your True(x) ↔ ∃y Provable(y, x), could you outline what
>>>> you mean by "Provable"?
>>>
>>> http://liarparadox.org/index.php/2017/10/31/defining_tarski_truex/
>>>
>> I mean exactly the same thing as the Wikipedia link that I have
>>> referenced and quoted on the above link, except that my Γ only
>>> includes WFF that are axioms.
>>>
>> How do you choose your axioms?
>
> https://en.wikipedia.org/wiki/Formalism_(philosophy_of_mathematics)
> Axioms are not chosen they are constructed as the encoding of
> relations using finite strings. The encoded relations specify edges
> between nodes of a directed acyclic graph.
Suppose Mr X wants an axiomatic theory of order (>) on the natural
numbers(see footnote). How will Mr X choose his axioms? Never having
formulated an axiomatic theory myself, I am forced to guess, but I hope
my guess is a plausible. I think Mr X will choose a few *truths* about
>,0,1,... in the hope that all, or at least a good number of, the
truths about >,0,1,... will follow from them.
Such a procedure is not available to you. You can't choose a few
*truths* about the subject matter because for you true means provable,
and you will go round in a circle.
Footnote: the choice of > on N is arbitrary. Any axiomatic fragment of
mathematics will do.
--
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess. Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-11-02 14:22 -0500 |
| Message-ID | <iaWdnTh5Q_f37WbEnZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #165944 |
On 10/29/2017 9:35 AM, Peter Percival wrote:
> George Greene wrote:
>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>> The above formula is ultimate foundation of my refutation of the:
>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>
>>> The above formula says that True(X) is entirely defined by
>>> Provable(X).
>
> I don't know where the first post to this thread is, so I'm jumping in to the middle.
>
> About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean by "Provable"?
>
>
http://www.liarparadox.org/Provable_Mendelson.pdf
The YELLOW highlighted portions form the foundational basis for what I mean by Provable(X).
The paragraph following the YELLOW highlighted paragraph directly states what I mean by Provable.
The remaining material establishes common notational conventions that are essentially the same as I have been using.
--
Defining Tarski’s ∀x True(x) ↔ φ(x)
True(x) ↔ ∃y Provable(y, x)
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-11-02 19:52 +0000 |
| Message-ID | <otft2f$l81$1@news.albasani.net> |
| In reply to | #166162 |
Pete Olcott wrote:
> On 10/29/2017 9:35 AM, Peter Percival wrote:
>> George Greene wrote:
>>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>>> The above formula is ultimate foundation of my refutation of the:
>>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>>
>>>> The above formula says that True(X) is entirely defined by
>>>> Provable(X).
>>
>> I don't know where the first post to this thread is, so I'm jumping in
>> to the middle.
>>
>> About your True(x) ↔ ∃y Provable(y, x), could you outline what you
>> mean by "Provable"?
>>
>>
>
> http://www.liarparadox.org/Provable_Mendelson.pdf
> The YELLOW highlighted portions form the foundational basis for what I
> mean by Provable(X).
>
> The paragraph following the YELLOW highlighted paragraph directly states
> what I mean by Provable.
That'll not get you far, it only deals with propositional calculus.
>
> The remaining material establishes common notational conventions that
> are essentially the same as I have been using.
>
--
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess. Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-11-03 14:13 +0000 |
| Message-ID | <othtip$aob$1@news.albasani.net> |
| In reply to | #166167 |
Peter Percival wrote:
> Pete Olcott wrote:
>> On 10/29/2017 9:35 AM, Peter Percival wrote:
>>> George Greene wrote:
>>>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>>>> The above formula is ultimate foundation of my refutation of the:
>>>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>>>
>>>>> The above formula says that True(X) is entirely defined by
>>>>> Provable(X).
>>>
>>> I don't know where the first post to this thread is, so I'm jumping in
>>> to the middle.
>>>
>>> About your True(x) ↔ ∃y Provable(y, x), could you outline what you
>>> mean by "Provable"?
>>>
>>>
>>
>> http://www.liarparadox.org/Provable_Mendelson.pdf
>> The YELLOW highlighted portions form the foundational basis for what I
>> mean by Provable(X).
>>
>> The paragraph following the YELLOW highlighted paragraph directly states
>> what I mean by Provable.
>
> That'll not get you far, it only deals with propositional calculus.
Though, ironically, if "true" means "valid", the PC is one of the few
calculi where true may be defined to mean provable.
>>
>> The remaining material establishes common notational conventions that
>> are essentially the same as I have been using.
>>
>
>
--
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess. Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-02 20:10 +0000 |
| Message-ID | <87d1508mrc.fsf@bsb.me.uk> |
| In reply to | #166162 |
Pete Olcott <Pete@NoEmail.address> writes:
> On 10/29/2017 9:35 AM, Peter Percival wrote:
>> George Greene wrote:
>>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>>> The above formula is ultimate foundation of my refutation of the:
>>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>>
>>>> The above formula says that True(X) is entirely defined by
>>>> Provable(X).
>>
>> I don't know where the first post to this thread is, so I'm jumping
>> in to the middle.
>>
>> About your True(x) ↔ ∃y Provable(y, x), could you outline what you
>> mean by "Provable"?
>>
>
> http://www.liarparadox.org/Provable_Mendelson.pdf
> The YELLOW highlighted portions form the foundational basis for what I
> mean by Provable(X).
Peter asked about Provable in the quoted formula. It's clearly not the
same as Provable(X). Unless X is a pair, I suppose, but it would still
need explaining. A basis for what you mean is not substitute for what
you really mean.
Ideally you would simply define Provable(y, x) saying what domain y
ranges over, and how y relates to the provability of x. I'm pretty sure
this has been asked more than once already. I'm pretty sure you don't
want to answer.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-21 13:57 -0800 |
| Message-ID | <dada9b2d-88ad-4c2a-bdda-993e3ce09a8b@googlegroups.com> |
| In reply to | #165944 |
On Sunday, October 29, 2017 at 10:35:25 AM UTC-4, Peter Percival wrote: > About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean > by "Provable"? You may not ask me questions, ESPECIALLY questions of THIS insulting type. *I* never mean *SHIT* by *ANY*thing. When I use a term, it means what THE DICTIONARY says it means. Meanings and definitions are BY definition a contract AMONG speakers to use terms in a SHARED conventional way. All you do by asking this stupid kind of definitional question is prove yourself too ignorant to be in the community of people WHO KNOW what the term means. Meaning IS NOT personal or subjective, *E*V*E*R*. "What do You mean by [term]" IS ALWAYS a STUPID question.
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-11-21 22:39 +0000 |
| Message-ID | <ov29uo$33a$2@news.albasani.net> |
| In reply to | #167238 |
George Greene wrote:
> On Sunday, October 29, 2017 at 10:35:25 AM UTC-4, Peter Percival wrote:
>> About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean
>> by "Provable"?
> You may not ask me questions, ESPECIALLY questions of THIS insulting type.
> *I* never mean *SHIT* by *ANY*thing. When I use a term, it means what THE DICTIONARY says it means. Meanings and definitions are BY definition a contract AMONG speakers to use terms in a SHARED conventional way. All you do by asking this stupid kind of definitional question is prove yourself too ignorant to be in the community of people WHO KNOW what the term means. Meaning IS NOT personal or subjective, *E*V*E*R*. "What do You mean by [term]" IS ALWAYS a STUPID question.
>
Here, 'twixt **** and **** is my post and its context:
****
George Greene wrote:
> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>> The above formula is ultimate foundation of my refutation of the:
>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>
>> The above formula says that True(X) is entirely defined by
>> Provable(X).
I don't know where the first post to this thread is, so I'm jumping in
to the middle.
About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean
by "Provable"?
****
Note that I was asking Peter Olcott about his "True(x) ↔ ∃y Provable(y, x)".
If you wrote "True(x) ↔ ∃y Provable(y, x)", I might ask you the same
question, but you didn't so I'm not.
--
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess. Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2017-11-22 13:44 +0000 |
| Message-ID | <ov3uvg$98a$1@news.albasani.net> |
| In reply to | #167242 |
Peter Percival wrote:
> George Greene wrote:
>> On Sunday, October 29, 2017 at 10:35:25 AM UTC-4, Peter Percival wrote:
>>> About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean
>>> by "Provable"?
>> You may not ask me questions, ESPECIALLY questions of THIS insulting
>> type.
>> *I* never mean *SHIT* by *ANY*thing. When I use a term, it means what
>> THE DICTIONARY says it means.
And another thing, your claim is a silly one. If, in the context of
formal logic, someone claims that x is provable, one may always ask what
does that mean, meaning 'of what theory is x a theorem?'.
>> Meanings and definitions are BY
>> definition a contract AMONG speakers to use terms in a SHARED
>> conventional way. All you do by asking this stupid kind of
>> definitional question is prove yourself too ignorant to be in the
>> community of people WHO KNOW what the term means. Meaning IS NOT
>> personal or subjective, *E*V*E*R*. "What do You mean by [term]" IS
>> ALWAYS a STUPID question.
>>
>
> Here, 'twixt **** and **** is my post and its context:
>
> ****
> George Greene wrote:
>> On Thursday, October 26, 2017 at 5:01:59 PM UTC-4, Pete Olcott wrote:
>>> The above formula is ultimate foundation of my refutation of the:
>>> {1931 GIT, Halting Problem proof, Liar Paradox}.
>>>
>>> The above formula says that True(X) is entirely defined by
>>> Provable(X).
>
> I don't know where the first post to this thread is, so I'm jumping in
> to the middle.
>
> About your True(x) ↔ ∃y Provable(y, x), could you outline what you mean
> by "Provable"?
> ****
>
> Note that I was asking Peter Olcott about his "True(x) ↔ ∃y Provable(y,
> x)".
>
> If you wrote "True(x) ↔ ∃y Provable(y, x)", I might ask you the same
> question, but you didn't so I'm not.
>
--
Do, as a concession to my poor wits, Lord Darlington, just explain
to me what you really mean.
I think I had better not, Duchess. Nowadays to be intelligible is
to be found out. -- Oscar Wilde, Lady Windermere's Fan
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-21 13:59 -0800 |
| Message-ID | <4a0eadc3-3ae9-4b06-a9b7-35c336102e52@googlegroups.com> |
| In reply to | #165944 |
On Tuesday, October 31, 2017 at 11:24:20 AM UTC-4, Pete Olcott wrote:
> On 10/29/2017 9:35 AM, Peter Percival
> wrote:
>
>
> George
> Greene wrote:
>
>
> On Thursday, October 26, 2017 at 5:01:59
> PM UTC-4, Pete Olcott wrote:
>
>
> The above formula is ultimate foundation
> of my refutation of the:
>
>
> {1931 GIT, Halting Problem proof, Liar Paradox}.
>
>
>
>
> The above formula says that True(X) is entirely defined
> by
>
>
> Provable(X).
It says nothing of the kind. Why are you SO illiterate??
> Here it is explained in using conventional notation:
>
> https://en.wikipedia.org/wiki/Logical_consequence#Syntactic_consequence
>
>
>
> A formula A is a syntactic consequence within some formal system
> FS of a set Γ of formulas if there is a formal proof in FS of A
> from the set Γ.
All that says is that somnething is provable iff there is a proof of it.
THE DICTIONARY BY ITSELF could have told PP *THAT*. That makes it a stupid question. Unless he was insulting YOUR intelligence by hoping you personally were under the impression that the meaning was something else.
[toc] | [prev] | [standalone]
Back to top | Article view | sci.logic
csiph-web