[FRIAM] Natures_Queer_Performativity_the_authori.pdf

[jon zingale]

Mmm, long division is an interesting one. Who am I to say how things must be
proved, but the proofs of the division algorithm with which I am familiar
involve the well-ordering principle. There, in this one idea, lies two
problematic details:
1. The non-algebraic nature of the  well-ordering principle
<https://en.wikipedia.org/wiki/Well-ordering_principle>  , and its
correlative  controversies . As outlined in the paper, "It has been shown
that if you want to believethe well-ordering theorem, then it must be taken
as an axiom."
 2. The first significant moment where intension in the form of
computational complexity enters an otherwise extensional number theory.



--
Sent from: http://friam.471366.n2.nabble.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://redfish.com/pipermail/friam_redfish.com/attachments/20210430/0c872daf/attachment.html>