The End of an Era - That of The Natural Numbers
in [Logic]
|
Prev: What are deliberately flawed & fallacious Arguments? Sophistry!
Next: sci.lang is not meant for advertising
From: Nam Nguyen on 22 May 2010 00:47 William Hughes wrote: > On May 22, 12:15 am, Nam Nguyen <namducngu...(a)shaw.ca> wrote: >> William Hughes wrote: > >>> The simple "yes/no" question is >>> Is there a model L1 with the property that >>> every provable formula in T is true in L1? >> That's not what you asked me before and, iirc, I didn't say of >> such a thing. >> >> But my answer to this question would be no, having not reflected >> too much on it yet. > > > In the sense that the rest of the world means "model" > an inconsistent T does not have a model. You got to review you understanding of model definition, because you don't. You should go by technical definitions, essence, and not by what you term "the world". (During Newton's era the "world" didn't include Einstein; during Hilbert's one didn't Godel; and during Euclidean's didn't Riemann). > Next question. Let L be the trivial model. > Is > > "for all x, x=/=x" > > true in L. Same old question which has been answered ALREADY. Read my recent post.
From: William Hughes on 22 May 2010 00:51 On May 22, 1:47 am, Nam Nguyen <namducngu...(a)shaw.ca> wrote: > William Hughes wrote: > > Next question. Let L be the trivial model. > > Is > > > "for all x, x=/=x" > > > true in L. > <snip evasion> Try again. Begin your answer with Yes or No. - William Hughes
From: Nam Nguyen on 22 May 2010 01:02 William Hughes wrote: > On May 22, 1:47 am, Nam Nguyen <namducngu...(a)shaw.ca> wrote: >> William Hughes wrote: > >>> Next question. Let L be the trivial model. >>> Is >>> "for all x, x=/=x" >>> true in L. > > <snip evasion> > > Try again. Begin your answer with Yes or No. I had a posted with technical examples of T1, T2, T3 and M1, M2, M3; and M3 would have the answer already. Can't you know how to read _technical arguments_ ? (You really sound like a kid wanting to "win" at all cost!)
From: William Hughes on 22 May 2010 06:35 On May 22, 2:02 am, Nam Nguyen <namducngu...(a)shaw.ca> wrote: > William Hughes wrote: > > On May 22, 1:47 am, Nam Nguyen <namducngu...(a)shaw.ca> wrote: > >> William Hughes wrote: > > >>> Next question. Let L be the trivial model. > >>> Is > >>> "for all x, x=/=x" > >>> true in L. > > > <snip evasion> > > > Try again. Begin your answer with Yes or No. > <snip evasion> Try again - William Hughes
From: Nam Nguyen on 22 May 2010 10:39
William Hughes wrote: > On May 22, 2:02 am, Nam Nguyen <namducngu...(a)shaw.ca> wrote: >> William Hughes wrote: >>> On May 22, 1:47 am, Nam Nguyen <namducngu...(a)shaw.ca> wrote: >>>> William Hughes wrote: >>>>> Next question. Let L be the trivial model. >>>>> Is >>>>> "for all x, x=/=x" >>>>> true in L. >>> <snip evasion> >>> Try again. Begin your answer with Yes or No. > <snip evasion> > > Try again I had a posted with technical examples of T1, T2, T3 and M1, M2, M3; and M3 would have the answer already. Can't you know how to read _technical arguments_ ? (You really sound like a kid wanting to "win" at all cost!) |