Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #40473 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-10-17 09:23 -0500 |
| Last post | 2021-10-17 12:55 -0500 |
| Articles | 20 on this page of 28 — 7 participants |
Back to article view | Back to comp.theory
My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 09:23 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 10:20 -0600
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 12:07 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 11:50 -0600
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 12:57 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 12:44 -0600
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 14:06 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 13:31 -0600
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 16:08 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 15:25 -0500
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 17:01 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-18 09:55 -0500
Re: My augmentation to foundationalism Jim Burns <james.g.burns@att.net> - 2021-10-18 12:12 -0400
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-18 21:42 -0400
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-18 22:48 -0400
Re: My augmentation to foundationalism Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-17 18:15 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-18 10:02 -0500
Re: My augmentation to foundationalism Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-19 00:02 +0100
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-18 21:56 -0400
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 13:22 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 13:41 -0500
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 15:02 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 14:12 -0500
Re: My augmentation to foundationalism Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-17 15:37 -0400
Re: My augmentation to foundationalism Jeff Barnett <jbb@notatt.com> - 2021-10-17 14:01 -0600
Re: My augmentation to foundationalism Jeff Barnett <jbb@notatt.com> - 2021-10-17 17:43 -0600
Re: My augmentation to foundationalism Jim Burns <james.g.burns@att.net> - 2021-10-17 13:44 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 12:55 -0500
Page 1 of 2 [1] 2 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-17 09:23 -0500 |
| Subject | My augmentation to foundationalism |
| Message-ID | <1b-dnSqdp-9YrPH8nZ2dnUU7-V3NnZ2d@giganews.com> |
The epistemological foundation is the notion of truth itself is anchored in philosophy. https://plato.stanford.edu/entries/justep-foundational/ Here is my addition to this field: Knowledge is a fully justified true belief such that the truth of the belief is a necessary consequence of its justification. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-17 10:20 -0600 |
| Message-ID | <skhihb$253$1@dont-email.me> |
| In reply to | #40473 |
On 2021-10-17 08:23, olcott wrote: > The epistemological foundation is the notion of truth itself is anchored > in philosophy. https://plato.stanford.edu/entries/justep-foundational/ The foundation of what? And the above sentence has too many verbs has. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-17 12:07 -0500 |
| Message-ID | <QOidnUdMlufxxfH8nZ2dnUU7-dWdnZ2d@giganews.com> |
| In reply to | #40479 |
On 10/17/2021 11:20 AM, André G. Isaak wrote: > On 2021-10-17 08:23, olcott wrote: >> The epistemological foundation is the notion of truth itself is >> anchored in philosophy. >> https://plato.stanford.edu/entries/justep-foundational/ > > The foundation of what? > > And the above sentence has too many verbs has. > > André > It you make sure to ignore the links that counts as sufficient evidence that you do not want an honest dialogue. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-17 11:50 -0600 |
| Message-ID | <skhnq4$879$1@dont-email.me> |
| In reply to | #40481 |
On 2021-10-17 11:07, olcott wrote: > On 10/17/2021 11:20 AM, André G. Isaak wrote: >> On 2021-10-17 08:23, olcott wrote: >>> The epistemological foundation is the notion of truth itself is >>> anchored in philosophy. >>> https://plato.stanford.edu/entries/justep-foundational/ >> >> The foundation of what? >> >> And the above sentence has too many verbs has. >> >> André >> > > It you make sure to ignore the links that counts as sufficient evidence > that you do not want an honest dialogue. I'm well aware of what epistemological foundationalism is. That tells me nothing about what *you* are attempting to convey with the above grammatically incoherent attempt at a sentence. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-17 12:57 -0500 |
| Message-ID | <9uidndz8OoeO-fH8nZ2dnUU7-dGdnZ2d@giganews.com> |
| In reply to | #40486 |
On 10/17/2021 12:50 PM, André G. Isaak wrote: > On 2021-10-17 11:07, olcott wrote: >> On 10/17/2021 11:20 AM, André G. Isaak wrote: >>> On 2021-10-17 08:23, olcott wrote: >>>> The epistemological foundation is the notion of truth itself is >>>> anchored in philosophy. >>>> https://plato.stanford.edu/entries/justep-foundational/ >>> >>> The foundation of what? >>> >>> And the above sentence has too many verbs has. >>> >>> André >>> >> >> It you make sure to ignore the links that counts as sufficient >> evidence that you do not want an honest dialogue. > > I'm well aware of what epistemological foundationalism is. That tells me > nothing about what *you* are attempting to convey with the above > grammatically incoherent attempt at a sentence. > > André > We can correct for the Gettier problem (with my correction) by defining knowledge as: YOU SIMPLY IGNORED THIS PART: Knowledge is a fully justified true belief such that the truth of the belief is a necessary consequence of its justification. This is best applied to the analytic side of the philosophical analytic / synthetic distinction where an expression of language can be verified as true entirely on the basis of its meaning. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-17 12:44 -0600 |
| Message-ID | <skhqts$trb$1@dont-email.me> |
| In reply to | #40488 |
On 2021-10-17 11:57, olcott wrote: > On 10/17/2021 12:50 PM, André G. Isaak wrote: >> On 2021-10-17 11:07, olcott wrote: >>> On 10/17/2021 11:20 AM, André G. Isaak wrote: >>>> On 2021-10-17 08:23, olcott wrote: >>>>> The epistemological foundation is the notion of truth itself is >>>>> anchored in philosophy. >>>>> https://plato.stanford.edu/entries/justep-foundational/ >>>> >>>> The foundation of what? >>>> >>>> And the above sentence has too many verbs has. >>>> >>>> André >>>> >>> >>> It you make sure to ignore the links that counts as sufficient >>> evidence that you do not want an honest dialogue. >> >> I'm well aware of what epistemological foundationalism is. That tells >> me nothing about what *you* are attempting to convey with the above >> grammatically incoherent attempt at a sentence. >> >> André >> > > We can correct for the Gettier problem (with my correction) by defining > knowledge as: > YOU SIMPLY IGNORED THIS PART: > Knowledge is a fully justified true belief such that the truth of the > belief is a necessary consequence of its justification. I did not ignore this. You made an incoherent statement which didn't even clearly identify its subject matter and then claimed the above was an 'addition' to this. > This is best applied to the analytic side of the philosophical analytic > / synthetic distinction where an expression of language can be verified > as true entirely on the basis of its meaning. Foundationalism is an approach to *epistemology*. The analytic/synthetic distinction is part of the philosophy *of language*, which is an entirely unrelated field. But, since epistemology is concerned with our knowledge of the world (i.e. it deals with empirical knowledge), it wouldn't care about 'analytic' sentences at all. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-17 14:06 -0500 |
| Message-ID | <NL6dnUOz-72w6fH8nZ2dnUU7-YmdnZ2d@giganews.com> |
| In reply to | #40492 |
On 10/17/2021 1:44 PM, André G. Isaak wrote: > On 2021-10-17 11:57, olcott wrote: >> On 10/17/2021 12:50 PM, André G. Isaak wrote: >>> On 2021-10-17 11:07, olcott wrote: >>>> On 10/17/2021 11:20 AM, André G. Isaak wrote: >>>>> On 2021-10-17 08:23, olcott wrote: >>>>>> The epistemological foundation is the notion of truth itself is >>>>>> anchored in philosophy. >>>>>> https://plato.stanford.edu/entries/justep-foundational/ >>>>> >>>>> The foundation of what? >>>>> >>>>> And the above sentence has too many verbs has. >>>>> >>>>> André >>>>> >>>> >>>> It you make sure to ignore the links that counts as sufficient >>>> evidence that you do not want an honest dialogue. >>> >>> I'm well aware of what epistemological foundationalism is. That tells >>> me nothing about what *you* are attempting to convey with the above >>> grammatically incoherent attempt at a sentence. >>> >>> André >>> >> >> We can correct for the Gettier problem (with my correction) by >> defining knowledge as: >> YOU SIMPLY IGNORED THIS PART: >> Knowledge is a fully justified true belief such that the truth of the >> belief is a necessary consequence of its justification. > > I did not ignore this. You made an incoherent statement which didn't > even clearly identify its subject matter and then claimed the above was > an 'addition' to this. > >> This is best applied to the analytic side of the philosophical >> analytic / synthetic distinction where an expression of language can >> be verified as true entirely on the basis of its meaning. > > Foundationalism is an approach to *epistemology*. The analytic/synthetic > distinction is part of the philosophy *of language*, which is an > entirely unrelated field. But, since epistemology is concerned with our > knowledge of the world (i.e. it deals with empirical knowledge), it > wouldn't care about 'analytic' sentences at all. > > André > I will put it in simpler terms. The only way that we can know with 100% perfectly complete logical certainty that an expression of language is true is when its truth can be totally verified entirely on the basis of its meaning. This does provide the foundation of all analytical truth. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-10-17 13:31 -0600 |
| Message-ID | <skhtn0$haf$1@dont-email.me> |
| In reply to | #40495 |
On 2021-10-17 13:06, olcott wrote: > On 10/17/2021 1:44 PM, André G. Isaak wrote: >> On 2021-10-17 11:57, olcott wrote: >>> On 10/17/2021 12:50 PM, André G. Isaak wrote: >>>> On 2021-10-17 11:07, olcott wrote: >>>>> On 10/17/2021 11:20 AM, André G. Isaak wrote: >>>>>> On 2021-10-17 08:23, olcott wrote: >>>>>>> The epistemological foundation is the notion of truth itself is >>>>>>> anchored in philosophy. >>>>>>> https://plato.stanford.edu/entries/justep-foundational/ >>>>>> >>>>>> The foundation of what? >>>>>> >>>>>> And the above sentence has too many verbs has. >>>>>> >>>>>> André >>>>>> >>>>> >>>>> It you make sure to ignore the links that counts as sufficient >>>>> evidence that you do not want an honest dialogue. >>>> >>>> I'm well aware of what epistemological foundationalism is. That >>>> tells me nothing about what *you* are attempting to convey with the >>>> above grammatically incoherent attempt at a sentence. >>>> >>>> André >>>> >>> >>> We can correct for the Gettier problem (with my correction) by >>> defining knowledge as: >>> YOU SIMPLY IGNORED THIS PART: >>> Knowledge is a fully justified true belief such that the truth of the >>> belief is a necessary consequence of its justification. >> >> I did not ignore this. You made an incoherent statement which didn't >> even clearly identify its subject matter and then claimed the above >> was an 'addition' to this. >> >>> This is best applied to the analytic side of the philosophical >>> analytic / synthetic distinction where an expression of language can >>> be verified as true entirely on the basis of its meaning. >> >> Foundationalism is an approach to *epistemology*. The >> analytic/synthetic distinction is part of the philosophy *of >> language*, which is an entirely unrelated field. But, since >> epistemology is concerned with our knowledge of the world (i.e. it >> deals with empirical knowledge), it wouldn't care about 'analytic' >> sentences at all. >> >> André >> > > I will put it in simpler terms. > The only way that we can know with 100% perfectly complete logical > certainty that an expression of language is true is when its truth can > be totally verified entirely on the basis of its meaning. Putting aside the question of whether the above is even remotely worthwhile, if that is your actual claim then why are you bringing up Foundationalism, justification, or the Gettier problem, none of which are concerned with expressions of language? > This does provide the foundation of all analytical truth. The set of purely analytic expressions of language is (a) extremely small and (b) entirely uninteresting. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-17 16:08 -0400 |
| Message-ID | <No%aJ.28981$Im6.16021@fx09.iad> |
| In reply to | #40495 |
On 10/17/21 3:06 PM, olcott wrote: > > I will put it in simpler terms. > The only way that we can know with 100% perfectly complete logical > certainty that an expression of language is true is when its truth can > be totally verified entirely on the basis of its meaning. > > This does provide the foundation of all analytical truth. But the flaw is that not all analytical truths are knowable (in some fields). Math is built on logical definitions that allow for statements to exist that we know must be either True of False, but that we are unable to actually 'prove' by analytical proof which it is. Or Knowledge requires Truth to exist, but Truth does NOT require Knowledge to be available.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-17 15:25 -0500 |
| Message-ID | <_ZidncJIB8ExG_H8nZ2dnUU7-f3NnZ2d@giganews.com> |
| In reply to | #40500 |
On 10/17/2021 3:08 PM, Richard Damon wrote: > On 10/17/21 3:06 PM, olcott wrote: >> >> I will put it in simpler terms. >> The only way that we can know with 100% perfectly complete logical >> certainty that an expression of language is true is when its truth can >> be totally verified entirely on the basis of its meaning. >> >> This does provide the foundation of all analytical truth. > > But the flaw is that not all analytical truths are knowable (in some > fields). > Expressions of language that have unknown truth values are simply excluded from the body of knowledge. > Math is built on logical definitions that allow for statements to exist > that we know must be either True of False, but that we are unable to > actually 'prove' by analytical proof which it is. > Any expression of language that cannot be proven true is necessarily untrue, yet possibly also not false. Some expressions of language are simply not bearers of truth values. > Or Knowledge requires Truth to exist, but Truth does NOT require > Knowledge to be available. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-17 17:01 -0400 |
| Message-ID | <za0bJ.2114$1E49.1970@fx01.iad> |
| In reply to | #40504 |
On 10/17/21 4:25 PM, olcott wrote: > On 10/17/2021 3:08 PM, Richard Damon wrote: >> On 10/17/21 3:06 PM, olcott wrote: >>> >>> I will put it in simpler terms. >>> The only way that we can know with 100% perfectly complete logical >>> certainty that an expression of language is true is when its truth >>> can be totally verified entirely on the basis of its meaning. >>> >>> This does provide the foundation of all analytical truth. >> >> But the flaw is that not all analytical truths are knowable (in some >> fields). >> > > Expressions of language that have unknown truth values are simply > excluded from the body of knowledge. But may still be true. And it is also a fact that you might not know if something can be in the body of knowledge. > >> Math is built on logical definitions that allow for statements to >> exist that we know must be either True of False, but that we are >> unable to actually 'prove' by analytical proof which it is. >> > > Any expression of language that cannot be proven true is necessarily > untrue, yet possibly also not false. Some expressions of language are > simply not bearers of truth values. WRONG. That statement was disproved a century ago. There are statements which it is provable that they must be either True or False, but it is impossible to actually prove if they are True or False. One interesting problem with your position, is it turns out that if you won't accept that a statement is a Truth Bearer unless it is provable, then there exist statements that you can't tell if they ARE Truth Bearers or not, as you can't prove if they are provable. And this continues to infinity. THis means that you really can't make a statement to be decided on until you prove that it IS decidable, and you can't really ask if it is decidable until your prove that its decidability is decidable, and so on. This severely limits the power of a system of logic that refuses to acknowledge the existance of truth values for statements that are not provable. You seem to be a century behind in the theories of knowledge, probably because you refuse to study some of what has been done because you don't 'believe' they can be right. You have basically condemned yourself to repeat the errors of the past, and don't have the excusses that they did back then. Yes, There ARE realms where you can use that sort of logic, but there are also realms where it does not work. You just don't understand where that line is and it bashes you in the head and makes you stupid.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-18 09:55 -0500 |
| Message-ID | <QYadnQWZZK2dFvD8nZ2dnUU7-cnNnZ2d@giganews.com> |
| In reply to | #40505 |
On 10/17/2021 4:01 PM, Richard Damon wrote: > > On 10/17/21 4:25 PM, olcott wrote: >> On 10/17/2021 3:08 PM, Richard Damon wrote: >>> On 10/17/21 3:06 PM, olcott wrote: >>>> >>>> I will put it in simpler terms. >>>> The only way that we can know with 100% perfectly complete logical >>>> certainty that an expression of language is true is when its truth >>>> can be totally verified entirely on the basis of its meaning. >>>> >>>> This does provide the foundation of all analytical truth. >>> >>> But the flaw is that not all analytical truths are knowable (in some >>> fields). >>> >> >> Expressions of language that have unknown truth values are simply >> excluded from the body of knowledge. > > But may still be true. That does not matter they do not count as truth or as knowledge until after they have been proven true. Only Wittgenstein understood this: (see page 6 for full quote) https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel > And it is also a fact that you might not know if > something can be in the body of knowledge. That is very simple if it is true and no one knows it then it is not knowledge. >> >>> Math is built on logical definitions that allow for statements to >>> exist that we know must be either True of False, but that we are >>> unable to actually 'prove' by analytical proof which it is. >>> >> >> Any expression of language that cannot be proven true is necessarily >> untrue, yet possibly also not false. Some expressions of language are >> simply not bearers of truth values. > > WRONG. That statement was disproved a century ago. This is a misconception based on defining truth and knowledge in an incoherent way. > There are statements > which it is provable that they must be either True or False, but it is > impossible to actually prove if they are True or False. > That is the same kind of crap that has nitwits believing that there was election fraud when there was no evidence of election fraud. When a large group of people have a psychotic break from reality on the basis of Nazi style propaganda the one key thing that would point them to the actual truth is the idea that no statement is true until after it has been proven. > One interesting problem with your position, is it turns out that if you > won't accept that a statement is a Truth Bearer unless it is provable, > then there exist statements that you can't tell if they ARE Truth > Bearers or not, as you can't prove if they are provable. And this > continues to infinity. Yes this is correct. When we really don't know it can be quite horrific in some cases for us to presume that we do know. With my system we have a finite set of expressions of language that are confirmed to be definitely true and an infinite set that are unconfirmed as true. There are some things that are known to be true the rest are unknown to be true with no emotional attachment to an opinion (belief) inbetween. There is also a weight of evidence to be applied when we have incomplete information. When there is no evidence that an expression of language is true it is still considered possible thus carries negligible weight. Whatever view objectively carries the most weight of evidence becomes the current working hypothesis. > > THis means that you really can't make a statement to be decided on until > you prove that it IS decidable, and you can't really ask if it is > decidable until your prove that its decidability is decidable, and so on. > This whole overload of the term "decidable" is far too misleading. The actual case is that the reason that we cannot decide between yes and no is that the expression of langugae is simply not truth bearer. What time is it (yes or no)? I can't decide (make up my mind.) > This severely limits the power of a system of logic that refuses to > acknowledge the existance of truth values for statements that are not > provable. > Their truth values don't exist. "This sentence is not true." is indeed not true because it is not a truth bearer. > You seem to be a century behind in the theories of knowledge, probably > because you refuse to study some of what has been done because you don't > 'believe' they can be right. You have basically condemned yourself to > repeat the errors of the past, and don't have the excusses that they did > back then. > I simply have a deeper insight because I studied these things from first principles rather than even tentatively accept the preexisting framework of misconceptions. I have known since 1997 that if Gödel's 1931 incompleteness theorem and the halting problem are correct then the basic notion of truth itself must be broken. Tarski's Undefinability theorem (that directly applies to the notion of truth itself) confirms this. > Yes, There ARE realms where you can use that sort of logic, but there > are also realms where it does not work. You just don't understand where > that line is and it bashes you in the head and makes you stupid. It works for the entire body of analytical knowledge: Expressions of language that can be verified as completely true entirely based on their meaning. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2021-10-18 12:12 -0400 |
| Message-ID | <883a6606-9696-d5dc-1967-d2f91ac70682@att.net> |
| In reply to | #40522 |
On 10/18/2021 10:55 AM, olcott wrote: > On 10/17/2021 4:01 PM, Richard Damon wrote: >> On 10/17/21 4:25 PM, olcott wrote: >>> On 10/17/2021 3:08 PM, Richard Damon wrote: >>>> On 10/17/21 3:06 PM, olcott wrote: >>>>> I will put it in simpler terms. >>>>> The only way that we can know with 100% perfectly complete >>>>> logical certainty that an expression of language is true is >>>>> when its truth can be totally verified entirely on the basis >>>>> of its meaning. >>>>> This does provide the foundation of all analytical truth. >>>> >>>> But the flaw is that not all analytical truths are knowable >>>> (in some fields). >>> >>> Expressions of language that have unknown truth values are >>> simply excluded from the body of knowledge. >> >> But may still be true. > > That does not matter they do not count as truth or as > knowledge until after they have been proven true. A modest proposal: Analytic truths _constrain_ reality (though it's true they need not be about only reality). '4 - 2 = 2' is an analytic truth. It _constrains_ what the real answer can be to | | Betty had four apples. | Then she gave two of them to Bill. | How many does she have now? I think that this is why we call them "truths" instead of "analytic symbol grab-bags". But what is reality? | | Reality is that which, when you stop believing in it, | doesn't go away. | ― Philip K. Dick, I Hope I Shall Arrive Soon It seems to me that welding truth to knowledge misses the point of truth, which is that, if we play our cards right, we can expand knowledge further into truth. You suggest that there is no "there" there to expand into.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-18 21:42 -0400 |
| Message-ID | <ropbJ.4$xQ7.0@fx07.iad> |
| In reply to | #40522 |
On 10/18/21 10:55 AM, olcott wrote: > On 10/17/2021 4:01 PM, Richard Damon wrote: >> >> On 10/17/21 4:25 PM, olcott wrote: >>> On 10/17/2021 3:08 PM, Richard Damon wrote: >>>> On 10/17/21 3:06 PM, olcott wrote: >>>>> >>>>> I will put it in simpler terms. >>>>> The only way that we can know with 100% perfectly complete logical >>>>> certainty that an expression of language is true is when its truth >>>>> can be totally verified entirely on the basis of its meaning. >>>>> >>>>> This does provide the foundation of all analytical truth. >>>> >>>> But the flaw is that not all analytical truths are knowable (in some >>>> fields). >>>> >>> >>> Expressions of language that have unknown truth values are simply >>> excluded from the body of knowledge. >> >> But may still be true. > > That does not matter they do not count as truth or as knowledge until > after they have been proven true. Says WHO? Some day you will meet the ultimate truth, and will have to explain why you persisted in promoting untruths. > > Only Wittgenstein understood this: (see page 6 for full quote) > > https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel > > >> And it is also a fact that you might not know if something can be in >> the body of knowledge. > > That is very simple if it is true and no one knows it then it is not > knowledge. But still Truth. You still don't understand the limit that you are boxing yourself into. If you only allow your > >>> >>>> Math is built on logical definitions that allow for statements to >>>> exist that we know must be either True of False, but that we are >>>> unable to actually 'prove' by analytical proof which it is. >>>> >>> >>> Any expression of language that cannot be proven true is necessarily >>> untrue, yet possibly also not false. Some expressions of language are >>> simply not bearers of truth values. >> >> WRONG. That statement was disproved a century ago. > > This is a misconception based on defining truth and knowledge in an > incoherent way. WRONG. > >> There are statements which it is provable that they must be either >> True or False, but it is impossible to actually prove if they are True >> or False. >> > > That is the same kind of crap that has nitwits believing that there was > election fraud when there was no evidence of election fraud. STRAWMAN. Just because > > When a large group of people have a psychotic break from reality on the > basis of Nazi style propaganda the one key thing that would point them > to the actual truth is the idea that no statement is true until after it > has been proven. If you only believe in what is proven, > >> One interesting problem with your position, is it turns out that if >> you won't accept that a statement is a Truth Bearer unless it is >> provable, then there exist statements that you can't tell if they ARE >> Truth Bearers or not, as you can't prove if they are provable. And >> this continues to infinity. > > Yes this is correct. When we really don't know it can be quite horrific > in some cases for us to presume that we do know. With my system we have > a finite set of expressions of language that are confirmed to be > definitely true and an infinite set that are unconfirmed as true. But if you only allow yourself to post a question that you KNOW can be proven, then you can only post the question if you KNOW it can be proven, but you can only ask if you can KNOW it can be proven if you KNOW That it CAN be know if it can be proven. Taken to the limot, this means you can't ask a question about anything unless you actually KNOW the answer, or have first PROVED (without asking about it) that it is provable. > > There are some things that are known to be true the rest are unknown to > be true with no emotional attachment to an opinion (belief) inbetween. > > There is also a weight of evidence to be applied when we have incomplete > information. When there is no evidence that an expression of language is > true it is still considered possible thus carries negligible weight. > > Whatever view objectively carries the most weight of evidence becomes > the current working hypothesis. How do you propose a proper Hypothesis, if you don't know that there IS an answer, by your definition, that isn't a proper question. And neither is the question about it being a proper question. etc. > >> >> THis means that you really can't make a statement to be decided on >> until you prove that it IS decidable, and you can't really ask if it >> is decidable until your prove that its decidability is decidable, and >> so on. >> > > This whole overload of the term "decidable" is far too misleading. The > actual case is that the reason that we cannot decide between yes and no > is that the expression of langugae is simply not truth bearer. And what is non-Truth Bearing about does a given machine M applied to input w being a Halting Computation. There ARE machines for which we can not prove if the answer is Yes or No, but we do know that in fact, it must be one or the other of the answers. YOUR language fails to handle this case. > > What time is it (yes or no)? I can't decide (make up my mind.) STRAWMAN. > >> This severely limits the power of a system of logic that refuses to >> acknowledge the existance of truth values for statements that are not >> provable. >> > > Their truth values don't exist. > "This sentence is not true." > is indeed not true because it is not a truth bearer. STRAWMAN. You like to statements which actually are not Truth Bearers to try to discredit the question that ARE Truth Bearers, but are unanswerable. > >> You seem to be a century behind in the theories of knowledge, probably >> because you refuse to study some of what has been done because you >> don't 'believe' they can be right. You have basically condemned >> yourself to repeat the errors of the past, and don't have the excusses >> that they did back then. >> > > I simply have a deeper insight because I studied these things from first > principles rather than even tentatively accept the preexisting framework > of misconceptions. And thus dopn't understand the basic principles that things are actually based on. > > I have known since 1997 that if Gödel's 1931 incompleteness theorem and > the halting problem are correct then the basic notion of truth itself > must be broken. Tarski's Undefinability theorem (that directly applies > to the notion of truth itself) confirms this. They show that YOUR concept of Truth is broken. YES. You don't understand the REAL nature of Truth. > >> Yes, There ARE realms where you can use that sort of logic, but there >> are also realms where it does not work. You just don't understand >> where that line is and it bashes you in the head and makes you stupid. > > It works for the entire body of analytical knowledge: Expressions of > language that can be verified as completely true entirely based on their > meaning. > It doesn't work for the analytical field of Mathematical (and other similar fields). Maybe you want to say that all of mathematics is illogical in your 'truth system', and if you want to say that, it is fine, but that means that you can't then work in those systems to try and show things, because you just don't understand that ground rules of those system. All Truth is Provable is incompatible with the fullness of Mathematics. That was shown a century ago, you can chose to keep to "All Truth is Provable", but then you bar yourself from being able to discuss the majority of mathematics that is based on definitions of Truth that is different for that. You are welcome to try to work on the parts of Mathematics that are compatible with that definition, but that excludes Computation Theory.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-18 22:48 -0400 |
| Message-ID | <LlqbJ.5$Vt4.2@fx21.iad> |
| In reply to | #40522 |
On 10/18/21 10:55 AM, olcott wrote: > On 10/17/2021 4:01 PM, Richard Damon wrote: >> >> On 10/17/21 4:25 PM, olcott wrote: >>> On 10/17/2021 3:08 PM, Richard Damon wrote: >>>> On 10/17/21 3:06 PM, olcott wrote: >>>>> >>>>> I will put it in simpler terms. >>>>> The only way that we can know with 100% perfectly complete logical >>>>> certainty that an expression of language is true is when its truth >>>>> can be totally verified entirely on the basis of its meaning. >>>>> >>>>> This does provide the foundation of all analytical truth. >>>> >>>> But the flaw is that not all analytical truths are knowable (in some >>>> fields). >>>> >>> >>> Expressions of language that have unknown truth values are simply >>> excluded from the body of knowledge. >> >> But may still be true. > > That does not matter they do not count as truth or as knowledge until > after they have been proven true. Let's put you to the test then. PROVE that statement. Note, you need to PROVE that your 'definition' is actually the correct one, you can't just assume it. You have 'assumed' a meaning for the word 'Truth', which isn't allowed by the plain meaning of your statement as you present it. If you can't actually PROVE your statement, then by your own statement, you can not count it as being 'true'. This is the fundamental problem with this statement, it needs to take itself as an unproven (and unprovable) truth, and thus actual disproves itself. The statement is NOT consistent with itself.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <news.x.richarddamon@xoxy.net> |
|---|---|
| Date | 2021-10-17 18:15 -0400 |
| Message-ID | <ski79v$jfm$1@dont-email.me> |
| In reply to | #40504 |
On 10/17/21 4:25 PM, olcott wrote: > On 10/17/2021 3:08 PM, Richard Damon wrote: >> On 10/17/21 3:06 PM, olcott wrote: >>> >>> I will put it in simpler terms. >>> The only way that we can know with 100% perfectly complete logical >>> certainty that an expression of language is true is when its truth >>> can be totally verified entirely on the basis of its meaning. >>> >>> This does provide the foundation of all analytical truth. >> >> But the flaw is that not all analytical truths are knowable (in some >> fields). >> > > Expressions of language that have unknown truth values are simply > excluded from the body of knowledge. They may be outside 'knowledge', but may still be statements of 'truth value' in the language. SOME bodies exclude the discussion of such items, but others do not. Both are valid. Mathematics, for one, allows the discussion of statements that might not be provable. > >> Math is built on logical definitions that allow for statements to >> exist that we know must be either True of False, but that we are >> unable to actually 'prove' by analytical proof which it is. >> > > Any expression of language that cannot be proven true is necessarily > untrue, yet possibly also not false. Some expressions of language are > simply not bearers of truth values. WRONG. Let me add, can you PROVE it, if not, by your rules you can't make it. Counter Example. All Computation, for example, which might be expressed as a pair of a Turing Machine and an input, will BY DEFINITION either Halt or not, so the halt status of a Computation is a bearer of a truth value. There DO exist computations for which we can not prove if they will be able to complete in a finite amount of time or not. > >> Or Knowledge requires Truth to exist, but Truth does NOT require >> Knowledge to be available. >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-10-18 10:02 -0500 |
| Message-ID | <TISdnQuXtoYIEfD8nZ2dnUU7-WfNnZ2d@giganews.com> |
| In reply to | #40508 |
On 10/17/2021 5:15 PM, Richard Damon wrote: > On 10/17/21 4:25 PM, olcott wrote: >> On 10/17/2021 3:08 PM, Richard Damon wrote: >>> On 10/17/21 3:06 PM, olcott wrote: >>>> >>>> I will put it in simpler terms. >>>> The only way that we can know with 100% perfectly complete logical >>>> certainty that an expression of language is true is when its truth >>>> can be totally verified entirely on the basis of its meaning. >>>> >>>> This does provide the foundation of all analytical truth. >>> >>> But the flaw is that not all analytical truths are knowable (in some >>> fields). >>> >> >> Expressions of language that have unknown truth values are simply >> excluded from the body of knowledge. > > They may be outside 'knowledge', but may still be statements of 'truth > value' in the language. > > SOME bodies exclude the discussion of such items, but others do not. > > Both are valid. Mathematics, for one, allows the discussion of > statements that might not be provable. > >> >>> Math is built on logical definitions that allow for statements to >>> exist that we know must be either True of False, but that we are >>> unable to actually 'prove' by analytical proof which it is. >>> >> >> Any expression of language that cannot be proven true is necessarily >> untrue, yet possibly also not false. Some expressions of language are >> simply not bearers of truth values. > > WRONG. > > Let me add, can you PROVE it, if not, by your rules you can't make it. > > Counter Example. > > All Computation, for example, which might be expressed as a pair of a > Turing Machine and an input, will BY DEFINITION either Halt or not, so > the halt status of a Computation is a bearer of a truth value. > I went over and over this with Ben for many years. If we assume that the finite string is a syntactically correct TM description P then we know that when P is simulated on its input P a simulating halt decider H(P,P) that this simulation will either reach its final state of P (WHETHER OR NOT H ABORTS THIS SIMULATION) or not. > There DO exist computations for which we can not prove if they will be > able to complete in a finite amount of time or not. > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its final state then when Ĥ.qx transitions to Ĥ.qn it is necessarily correct. https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >> >>> Or Knowledge requires Truth to exist, but Truth does NOT require >>> Knowledge to be available. >>> >> >> > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-19 00:02 +0100 |
| Message-ID | <87czo2aqcp.fsf@bsb.me.uk> |
| In reply to | #40523 |
olcott <NoOne@NoWhere.com> writes: > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state then when Ĥ.qx transitions to Ĥ.qn it is necessarily > correct. No. You've omitted the key phrase yet again: Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt. You have no excuse for removing it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-18 21:56 -0400 |
| Message-ID | <%ApbJ.4$Lu3.0@fx43.iad> |
| In reply to | #40523 |
On 10/18/21 11:02 AM, olcott wrote: > On 10/17/2021 5:15 PM, Richard Damon wrote: >> On 10/17/21 4:25 PM, olcott wrote: >>> On 10/17/2021 3:08 PM, Richard Damon wrote: >>>> On 10/17/21 3:06 PM, olcott wrote: >>>>> >>>>> I will put it in simpler terms. >>>>> The only way that we can know with 100% perfectly complete logical >>>>> certainty that an expression of language is true is when its truth >>>>> can be totally verified entirely on the basis of its meaning. >>>>> >>>>> This does provide the foundation of all analytical truth. >>>> >>>> But the flaw is that not all analytical truths are knowable (in some >>>> fields). >>>> >>> >>> Expressions of language that have unknown truth values are simply >>> excluded from the body of knowledge. >> >> They may be outside 'knowledge', but may still be statements of 'truth >> value' in the language. >> >> SOME bodies exclude the discussion of such items, but others do not. >> >> Both are valid. Mathematics, for one, allows the discussion of >> statements that might not be provable. >> >>> >>>> Math is built on logical definitions that allow for statements to >>>> exist that we know must be either True of False, but that we are >>>> unable to actually 'prove' by analytical proof which it is. >>>> >>> >>> Any expression of language that cannot be proven true is necessarily >>> untrue, yet possibly also not false. Some expressions of language are >>> simply not bearers of truth values. >> >> WRONG. >> >> Let me add, can you PROVE it, if not, by your rules you can't make it. >> >> Counter Example. >> >> All Computation, for example, which might be expressed as a pair of a >> Turing Machine and an input, will BY DEFINITION either Halt or not, so >> the halt status of a Computation is a bearer of a truth value. >> > > I went over and over this with Ben for many years. If we assume that the > finite string is a syntactically correct TM description P > > then we know that when P is simulated on its input P a simulating halt > decider H(P,P) that this simulation will either reach its final state of > P (WHETHER OR NOT H ABORTS THIS SIMULATION) or not. WRONG. UNSOUND LOGIC. FAIL. Try to ACTUAL prove it. I have pointed out MANY errors in your arguement which you have stated you haven't read, therefore YOU have failed at YOUR responsibility of proof. > >> There DO exist computations for which we can not prove if they will be >> able to complete in a finite amount of time or not. >> > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state then when Ĥ.qx transitions to Ĥ.qn it is necessarily correct. WRONG. > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > >>> >>>> Or Knowledge requires Truth to exist, but Truth does NOT require >>>> Knowledge to be available. >>>> >>> >>> >> > You fail to prove your claims, in a large part, because you don't really understand what you claim. Your refer to claissical proofs, and say you have counted them, when you have shown that you don't even understand that language that they are written in. As you have said, the mean of the words is important. Until you can show that you actually KNOW the meaning of the words, as used by the orignal proofs that you are claiming to have countered. Important note, you claim to be using 'First Principles', one big limitation of 'First Principles' is that if you are working on what someone else has said, the prerequisite to applying a First Principle approach is to actually KNOW what the principles THAT PERSON was using, you can NOT easily just 'discover' this by independent research, that tends to end up with your definitions differing from what you are trying to apply it to, and thus not really applicable. Until you really understand what a Computation is, and how Turing Machine actually work nothing you say is going to make any sense. Your 'claim' that code 'x' is the equivalence to Turing Machine 'y' is meaningless when you have made it clear that you don't really understand what a Turing Machine is, or what a Computation is (which is the basic theory behind Turing Machines). That is like a man blind from birth saying he know the real difference between scarlet and crimson, it isn't in his realm of understanding. You have blinded yourself to this area of Theory because you refuse to comprehend the basic aspects of the field. I think you are unable to understand things that are this abstract, as your mindset seem to be stuck in things that are concrete.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-10-17 13:22 -0400 |
| Message-ID | <LZYaJ.34293$IO1.21252@fx19.iad> |
| In reply to | #40473 |
On 10/17/21 10:23 AM, olcott wrote: > The epistemological foundation is the notion of truth itself is anchored > in philosophy. https://plato.stanford.edu/entries/justep-foundational/ > > Here is my addition to this field: Knowledge is a fully justified true > belief such that the truth of the belief is a necessary consequence of > its justification. > And is this 'definition' of Knowledge compatible with the field of Logic you are trying to apply it to? There is an immense difference between the 'Logic' of Philosophy and the Logic of Mathematics. Everything eventually needs to boil down to what definitions you accept. Mathematics has its own set it works with. If you want to disagree with them, fine, you just can't be working in the field of Mathematics. If you want to try to develope an alternate field of Mathematics based on a different set of definition, go ahead, just make it clear you are working a different field and start to work. One problem you will run into is you likely need to start a the very basics to make sure what still holds and not just jump to things like computation theory. My one concern is that you don't seem to have the basic critical reasoning capability to try to pull of something like this. The fact that you don't see the problem with having your logic system being able to prove two contradictory statements makes your really unsuitable for this sort of system building.
[toc] | [prev] | [next] | [standalone]
Page 1 of 2 [1] 2 Next page →
Back to top | Article view | comp.theory
csiph-web