Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.logic    |    Logic -- math, philosophy & computationa    |    262,912 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 262,837 of 262,912    |
|    olcott to Richard Damon    |
|    Re: Changing the foundational basis to P    |
|    07 Feb 26 09:10:00    |
      XPost: comp.theory       From: polcott333@gmail.com              On 2/7/2026 8:46 AM, Richard Damon wrote:       > On 2/7/26 9:22 AM, olcott wrote:       >> On 2/7/2026 7:50 AM, Richard Damon wrote:       >>> On 2/7/26 8:10 AM, olcott wrote:       >>>> On 2/7/2026 4:25 AM, Mikko wrote:       >>>>> On 06/02/2026 17:30, olcott wrote:       >>>>>> On 2/6/2026 3:01 AM, Mikko wrote:       >>>>>>> On 05/02/2026 18:55, olcott wrote:       >>>>>>>       >>>>>>>> Changing the foundational basis to Proof Theoretic Semantics       >>>>>>>> Tarski Undefinability is overcome       >>>>>>>>       >>>>>>>> x ∈ Provable ⇔ x ∈ True // proof theoretic semantics       >>>>>>>       >>>>>>> A definition in terms of an undefined symbol does not really define.       >>>>>>       >>>>>> It is an axiom: ∀x (Provable(x) ⇒ True(x))       >>>>>       >>>>> There are theories where every sentence is provable but it is not       >>>>> possiible to interprete any theory so that every sentence is true.       >>>>>       >>>>       >>>> Proof Theoretic Semantics enables       >>>> "true on the basis of meaning expressed in language"       >>>> to be reliably computable for the entire body of knowledge.       >>>>       >>>>       >>>       >>> No it doesn't, but then you never understood what truth is, or really       >>> what knowledge is.       >>>       >>       >> "true on the basis of meaning expressed in language"       >> expressions of language are defined in terms of other       >> expressions of language thus truth is computed on the       >> basis of relations between finite strings.       >       > In other words, you admit your definition is self-referenetial, and by       > your own claims, not a basis for logic.       >              It is an acyclic directed graph.              > But, by the actual meaning of the words, Godel's G is something that can       > be expressed in the language of PA, and has meaning, but is a statement       > that must be true in PA, but can not be proven in PA.       >       > If your "definition" doesn't do that, you need to show where it makes it       > not so.       >       >>       >>> You don't understand what Languages is as you think words are pliable       >>> and can be changed.       >>>       >>> You are just showing you are just a natural liar.       >>       >>       >                     --       Copyright 2026 Olcott |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca