Re: The seven step-Mathematical preliminaries 2

2009-06-05 Thread m.a.
Bruno, Thanks for the encouragement. I intend to follow your instructions and it's a relief to know that some of my answers were correct. However, I will be away for two weeks and unable to work on the lessons. I'll try to make up for it when I return. Best,

Re: The seven step-Mathematical preliminaries

2009-06-05 Thread A. Wolf
> From what you said earlier, BIGGEST={0,1,...,BIGGEST-1}. Then > BIGGEST+1={0,1,...,BIGGEST-1} union {BIGGEST} = {0,1,...,BIGGEST}. > Why would {0,1,...BIGGEST} not be a natural number while > {0,1,...,BIGGEST-1} is? If {0, 1, ... , BIGGEST-1} is a natural number, then {0,1,...,BIGGEST} is too

Re: Cognitive Theoretic Model of the Universe

2009-06-05 Thread Bruno Marchal
On 05 Jun 2009, at 14:23, ronaldheld wrote: > > Bruno: > I understand a little better. is there a citition for a version of > Church Thesis that all algorithm can be written in > FORTRAN? The original Church Thesis, (also due to Post, Turing, Markov, Kleene, and others independently) is thi

Re: The seven step-Mathematical preliminaries 2

2009-06-05 Thread Bruno Marchal
Hi Marty, On 05 Jun 2009, at 00:30, m.a. wrote: > Bruno, >I don't have dyslexia Good news. > but my keyboard doesn't contain either the UNION symbol or the > INTERSECTION symbol Nor do mine! > (unless I want to go into an INSERT pull down menu every time I use > th

Re: The seven step-Mathematical preliminaries

2009-06-05 Thread Brian Tenneson
Torgny Tholerus wrote: > Brian Tenneson skrev: > >> On Thu, Jun 4, 2009 at 8:27 AM, Torgny Tholerus > > wrote: >> >> >> Brian Tenneson skrev: >> > >> > >> > Torgny Tholerus wrote: >> >> It is impossible to create a set where the successor of every >

Re: Cognitive Theoretic Model of the Universe

2009-06-05 Thread Bruno Marchal
On 04 Jun 2009, at 21:23, Brent Meeker wrote: > > Bruno Marchal wrote: >> ... >>> Bruno Marchal wrote: >> >> The whole point of logic is to consider the "Peano's axioms" as a >> mathematical object itself, which is studied mathematically in the >> usual informal (yet rigorous and typically mathe

RE: The seven step-Mathematical preliminaries

2009-06-05 Thread Jesse Mazer
> Date: Fri, 5 Jun 2009 08:33:47 +0200 > From: tor...@dsv.su.se > To: everything-list@googlegroups.com > Subject: Re: The seven step-Mathematical preliminaries > > > Brian Tenneson skrev: >> >> >> On Thu, Jun 4, 2009 at 8:27 AM, Torgny Tholerus > > wrote: >> >> >>

Re: Cognitive Theoretic Model of the Universe

2009-06-05 Thread Quentin Anciaux
Well as FORTRAN is a turing complete language, then you can. As long as the programming language is universal/turing complete you can. http://en.wikipedia.org/wiki/Turing_completeness Regards, Quentin 2009/6/5 ronaldheld : > > Bruno: >  I understand a little better. is there a citition for a v

Re: Cognitive Theoretic Model of the Universe

2009-06-05 Thread ronaldheld
Bruno: I understand a little better. is there a citition for a version of Church Thesis that all algorithm can be written in FORTRAN? Ronald On Jun 4, 10:49 am, Bruno Marchal wrote: > Hi Ronald, > > On 02 Jun 2009, at 16:45, ronaldheld wrote: > > > > > Bruno: > >   Sin

Re: The seven step-Mathematical preliminaries

2009-06-05 Thread Quentin Anciaux
2009/6/5 Torgny Tholerus : > > Kory Heath skrev: >> On Jun 4, 2009, at 8:27 AM, Torgny Tholerus wrote: >> >>> How do you handle the Russell paradox with the set of all sets that >>> does >>> not contain itself?  Does that set contain itself or not? >>> >>> My answer is that that set does not conta

Re: The seven step-Mathematical preliminaries

2009-06-05 Thread Torgny Tholerus
Kory Heath skrev: > On Jun 4, 2009, at 8:27 AM, Torgny Tholerus wrote: > >> How do you handle the Russell paradox with the set of all sets that >> does >> not contain itself? Does that set contain itself or not? >> >> My answer is that that set does not contain itself, because no set can >>