Re: Cantorian pseudomathematics


MoeBlee wrote
> david petry wrote:
> > The point is that if you find an m, n, such that |pi - m/n| > f(n) is
> > false, you have falsified the assertion. Hence, the assertion is
> > falsifiable (that's what it means).
>
> If you find an n that has a 1-1 map onto a proper subset of itself,
> then you've falsified the assertion that no natural number is Dedekind
> infinite.
>
> MoeBlee

P.S. What is the domain of such a function as the function f you
mentioned?

.

Relevant Pages

  • Re: Provability
    ... MoeBlee wrote: ... not an algorithm unless proven to have certain properties as opposed ... and n a quadratic non-residue modulo p ... and assertion of its efficacy can be admitted ...
    (sci.math)
  • Re: Cantorian pseudomathematics
    ... MoeBlee wrote: ... > If you find an n that has a 1-1 map onto a proper subset of itself, ... > then you've falsified the assertion that no natural number is Dedekind ...
    (sci.math)
  • Re: Cantorian pseudomathematics
    ... >> MoeBlee wrote: ... >>> testing forever and never find out that there is no m and n such that ... >>> I think your distinction is not somewhat vague, but plain vague, as is ... you have falsified the assertion. ...
    (sci.math)
  • Re: Cantorian pseudomathematics
    ... you have falsified the assertion. ... If you find an n that has a 1-1 map onto a proper subset of itself, ... MoeBlee ... Prev by Date: ...
    (sci.math)
  • Re: Cyclist killers in local paper.
    ... So that contradicts your first statement. ... Either applies and the word is valid, or your assertion that, "It ... Care to try again, this time using a consistent form logic throughout ... Prev by Date: ...
    (uk.rec.cycling)