Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration finite foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf sheaves simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
  1. Added to natural number a discussion about the fact that constructively, the natural numbers may fail to be (order) complete, as highlighted by Andrej Bauer in a very nice blog post. I quite like this example, because by interpreting a related lemma in the internal language of a certain sheaf topos one obtains a well-known proposition in algebraic geometry almost for free (see entry); but please let me know if stuff like this is too localized for the nLab.

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeDec 9th 2013
    • (edited Dec 9th 2013)

    Thanks!

    Don’t worry, nothing is too localized for the nLab, and certainly not what you just added, I’d say. There is unbounded room. If something becomes too specialized for some entry (or feels like it does) we can split it off as a separate entry and link to it.

    One thing about type-setting: when you give names to propositions, you should put them in the third line, like this

     +-- {: .num_prop}
     ###### Proposition 
     **(a Brouwerian counterexample)**
    

    instead of at the end of the second line. Otherwise the numbering is moved too far to the right and can become hard to spot or else look awkward (I think). I have edited the entry accordingly, ever so slightly.

  2. Thank you for the editing and the tip! Looks much better this way.

    • CommentRowNumber4.
    • CommentAuthorColin Tan
    • CommentTimeDec 27th 2013
    If I am reading you correctly, then does this Brouwerian counter example demonstrate that the usual proof of the equivalence of the induction principle and well ordering principle uses the law of the excluded middle? That is to say,constructively, the natural numbers satisfy only the induction principle but not the well ordering principle.
    • CommentRowNumber5.
    • CommentAuthorZhen Lin
    • CommentTimeDec 27th 2013

    In fact the equivalence implies LEM. See here.

    • CommentRowNumber6.
    • CommentAuthorTobyBartels
    • CommentTimeDec 28th 2013

    It depends on what you mean by well ordering; if you define this properly, then it is constructively equivalent to induction. We call the (simpler!) definition of well ordering involving minimal elements classical well ordering; the natural numbers are constructively well ordered (if you accept induction), but their classical well ordering implies LEM (by Ingo's argument).

  3. Added to natural number a discussion about the stopping behaviour of weakly decreasing sequences of natural numbers.