Live data from Hacker News

Viewing profile — semolinapudding

semolinapudding

HN member
Joined
Fri, Dec 13, 2024, 3:06 AM UTC
HN karma
38
Public activity
12 items

About semolinapudding

No profile information was provided.

Recent public activity

  1. comment
    Comment #44776910

    FLT is a negative statement ("there are no nonzero integers x, y, z such that..."), and proofs by contradiction are constructively valid for proving negative statements.

  2. comment
    Comment #44775550

    For what it's worth, I don't think that Kevin Buzzard is the person you should talk to if you are interested in proof assistant design. As far as I know, Buzzard does not consider …

  3. comment
    Comment #44775519

    AFAICT, this issue only comes up if you form the quotient of a proposition by a relation. But there is no point in doing that (all the proofs of a proposition are already equal!) s…

  4. comment
    Comment #44775498

    Computation is the difference. In Lean, applying the universal property of the quotient (`Quotient.lift f Hf`) to an element that is of the form `Quotient.mk a` reduces to `f a`. T…

  5. comment
    Comment #44355891

    There is a nice illustration of a 2-sphere wrapped twice around another 2-sphere on the Wikipedia article for the homotopy groups of spheres [0]. Now, there are many ways of provin…

  6. comment
    Comment #43190063

    This makes me wonder whether the usual order for function application is an artifact of the S-V-O sentence structure in western European languages. Maybe if Euler had been raised i…

  7. comment
    Comment #43077155

    Good catch, thank you.

  8. comment
    Comment #43071179

    That's pretty cool, but the downsides of switching to RRA are not only about user experience. When the result is 0.0000000..., the calculator cannot decide whether it's fine to com…

  9. comment
    Comment #42494769

    ZFC is way worse than Presburger arithmetic -- since it is undecidable, we know that the length of the minimal proof of a statement cannot be bounded by a computable function of th…

  10. comment
    Comment #42410351

    There's a bit of a definition issue at play here. When Andreas Blass and Noah Schweber say that there is no proof system for PA_2, they mean that there is no effective proof system…

  11. comment
    Comment #42407787

    If you look at the Wikipedia page for second order arithmetic, there is a definition in the language of first order logic as a two-sorted theory comprising a handful of basic axiom…

  12. comment
    Comment #42405652

    The axioms of second order Peano arithmetic are certainly recursively enumerable, in fact you can pick a formulation that only uses a finite number of axioms. And second order arit…