🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.logic
Article #820

Re: A Guide for Cantor Cranks

#820
From: James Burns
Date: Thu, 24 Mar 2011 17:01
66 lines
4313 bytes
Albrecht wrote:
> On 24 Mrz., 15:08, James Burns <burns...@osu.edu> wrote:
>>Albrecht wrote:
>>>On 24 Mrz., 10:31, William Hughes
>>><wpihug...@gmail.com> wrote:

>>>>Absolute piffle.  There is no reason that defining the
>>>>existence of the limit of finite ratios means that you
>>>>have to define either infinite quantities, or the ratio
>>>>of infinite quantities.
>>>
>>>So you admit that an infinite decimal number has crucial
>>>other properties than a finite decimal number? You admit
>>>that a number like 3.1415... is crucial different from a
>>>number like 0.75? But you insist that the "behaviour" of
>>>a number like 3.1415... should be like the "behaviour" of
>>>a number like 0.75?
>>>
>>>The axioms behind this view are silly.
>>
>>If I am not mistaken, there is only one axiom that
>>distinguishes infinite decimal numbers (real numbers)
>>from finite decimal numbers (rational numbers, or close
>>enough for our purposes).
>>
>>< For every non-empty set of real numbers, if it has
>>< an upper bound, then it has a least upper bound.
>>
>>Upper bound and least upper bound are defined in the
>>expected ways:
>>
>>Upper bound of set A == a real number greater than or
>>equal to every element of A
>>
>>Least upper bound of set A == an upper bound of A
>>less than or equal to every upper bound of A
>>
>>I just wanted to be sure:
>>do you find this axiom silly?
>
> Axiom?

I'm not sure that I understand what, if anything,
you are asking.

Do you recall writing
"The axioms behind this view are silly"?
This is the one axiom behind that view,
the least upper bound axiom. (There are other
axioms that have the same effect, but this
serves as well as any.)
Do you find this axiom silly?

http://en.wikipedia.org/wiki/Least_upper_bound_axiom
< That is, if a nonempty set of real numbers has an
< upper bound, then it has a least upper bound.

Real numbers form a complete ordered field.
Rational numbers form an ordered field.
There is one more axiom for complete ordered fields
than for ordered fields, and one form of it is
the Least Upper Bound Axiom.

I suppose I could ask whether you find the other forms
silly as well, but I picked this one because it seems
the clearest to me, the least technical, if you will.
Technical Details
Message-ID: <4D8B78EF.9000807@osu.edu>
Path: arc1-ca.pugleaf.net!g2news1.google.com!news1.google.com!news2.google.com!news.glorb.com!news.cse.ohio-state.edu!nntp.service.ohio-state.edu!not-for-mail
References: <40e69d0c-eb77-4308-996e-c7dfc1a0ec1e@j13g2000pro.googlegroups.com> <2298d465-e708-4801-be12-12c714cd98dc@f36g2000pri.googlegroups.com> <2e445897-6fc0-488d-9ab5-fcd1c7dc703d@f30g2000yqa.googlegroups.com> <efc21f2f-acb7-475d-87ab-fbfa35208c4c@o15g2000prn.googlegroups.com> <9c851574-eb70-45c4-b6e3-9351a7679223@k30g2000yqb.googlegroups.com> <92a4e0aa-6497-4357-8a6b-ecc706fa10f5@d26g2000prn.googlegroups.com> <5d2c87a8-5926-4b27-a445-3bc3ab5c98d0@u3g2000vbe.googlegroups.com> <35760f05-df0e-4c29-85c0-08f98cf10a42@s18g2000prg.googlegroups.com> <521e5cfe-5269-4d9a-ab45-5e8cf597b2d1@y31g2000vbp.googlegroups.com> <971970b6-b722-4f38-96cb-4aef5f17e96e@b22g2000prb.googlegroups.com> <d9d86644-ea52-4f53-ba2f-42d2718630c0@k7g2000yqj.googlegroups.com> <b05355b2-d80e-47ec-9c3b-43e7bc40ab32@22g2000prx.googlegroups.com> <4D8B5041.9060702@osu.edu> <be4cc683-a233-4ddc-b0b7-977464537c90@w7g2000yqe.googlegroups.com>

Show Full Headers
Complete Article Headers
X-Google-Thread: db42311052,af7892021029fe4a
X-Google-Attributes: giddb42311052,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII-7-bit
Path: arc1-ca.pugleaf.net!g2news1.google.com!news1.google.com!news2.google.com!news.glorb.com!news.cse.ohio-state.edu!nntp.service.ohio-state.edu!not-for-mail
From: James Burns <burns.87@osu.edu>
Newsgroups: sci.logic,sci.math,comp.theory,sci.physics,aus.science
Subject: Re: A Guide for Cantor Cranks
Date: Thu, 24 Mar 2011 13:01:35 -0400
Organization: Ohio State University
Lines: 66
Message-ID: <4D8B78EF.9000807@osu.edu>
References: <40e69d0c-eb77-4308-996e-c7dfc1a0ec1e@j13g2000pro.googlegroups.com> <2298d465-e708-4801-be12-12c714cd98dc@f36g2000pri.googlegroups.com> <2e445897-6fc0-488d-9ab5-fcd1c7dc703d@f30g2000yqa.googlegroups.com> <efc21f2f-acb7-475d-87ab-fbfa35208c4c@o15g2000prn.googlegroups.com> <9c851574-eb70-45c4-b6e3-9351a7679223@k30g2000yqb.googlegroups.com> <92a4e0aa-6497-4357-8a6b-ecc706fa10f5@d26g2000prn.googlegroups.com> <5d2c87a8-5926-4b27-a445-3bc3ab5c98d0@u3g2000vbe.googlegroups.com> <35760f05-df0e-4c29-85c0-08f98cf10a42@s18g2000prg.googlegroups.com> <521e5cfe-5269-4d9a-ab45-5e8cf597b2d1@y31g2000vbp.googlegroups.com> <971970b6-b722-4f38-96cb-4aef5f17e96e@b22g2000prb.googlegroups.com> <d9d86644-ea52-4f53-ba2f-42d2718630c0@k7g2000yqj.googlegroups.com> <b05355b2-d80e-47ec-9c3b-43e7bc40ab32@22g2000prx.googlegroups.com> <4D8B5041.9060702@osu.edu> <be4cc683-a233-4ddc-b0b7-977464537c90@w7g2000yqe.googlegroups.com>
NNTP-Posting-Host: phy-dhcp-34-37.mps.ohio-state.edu
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: charm.magnus.acs.ohio-state.edu 1300986095 13449 128.146.34.37 (24 Mar 2011 17:01:35 GMT)
X-Complaints-To: abuse@osu.edu
NNTP-Posting-Date: 24 Mar 2011 17:01:35 GMT
User-Agent: Mozilla Thunderbird 1.0.6 (Windows/20050716)
X-Accept-Language: en-us, en
In-Reply-To: <be4cc683-a233-4ddc-b0b7-977464537c90@w7g2000yqe.googlegroups.com>