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).
    • CommentRowNumber1.
    • CommentAuthorMike Shulman
    • CommentTimeMar 30th 2012

    I added to decidable equality some remarks on the difference between the propositions-as-types version and the propositions-as-some-types version.

    • CommentRowNumber2.
    • CommentAuthorTobyBartels
    • CommentTimeMar 31st 2012

    Nice!

    • CommentRowNumber3.
    • CommentAuthorUrs
    • CommentTimeJan 4th 2015

    Over here somebody shows that he found the paragraph at decidable equality on Applications confusing.

    I suppose the paragraph was okay in itself and no expert would have found it confusing, but I see how for a novice it may not have been clear enough that throughout the entry the word “set” means different things depending on whether it is understood that one speaks constructively or not.

    In any case, I have edited ever so slightly in an attempt to clarify. But please feel invited to edit further.

    • CommentRowNumber4.
    • CommentAuthorMike Shulman
    • CommentTimeApr 3rd 2018

    Added examples and a mention of Bauer-Swan’s preprint that in function realizability all sets with decidable equality are countable.

    diff, v8, current

  1. Fixed typo in link

    Anonymous

    diff, v10, current

    • CommentRowNumber6.
    • CommentAuthorGuest
    • CommentTimeMar 26th 2023

    adding a section on defining decidable equality using the boolean domain

    diff, v13, current

  2. Removed incorrect statement that “(though the same is not true for finitely-indexed or subfinite sets)”

    Subfinite sets have decidable equality because they are subsets of a finite set, and equality is preserved and reflected for the canonical injection of a subfinite set into the corresponding finite set, by definition of injection.

    Anonymouse

    diff, v19, current

  3. Added examples of the Cantor space having decidable equality if and only if WLPO holds and the Dedekind reals having decidable equality if and only if analytic WLPO holds, and a remark that these represent examples of sets with decidable equality but where negation of equality is not an apartness relaiton

    Anonymouse

    diff, v19, current

  4. Countable really means “countably indexed” in the Bauer and Swan paper, since they defined it as having a surjection rather than a bijection with a decidable subset of the natural numbers and countably indexed sets do not in general have decidable equality. In fact, Andrej Bauer and James Hanson constructed a topos in which the Dedekind real numbers do not have decidable equality but are still countably indexed.

    Countably indexed sets are not to be confused with the countable sets which are the sets in bijection with a lower decidable subset of the natural numbers, which do come with decidable equality.

    Anonymouse

    diff, v19, current

  5. “Working with decidable subsets of sets with decidable equality makes constructive mathematics very much like classical mathematics.”

    This statement isn’t true either. Analytic WLPO implies that the Dedekind real numbers and every decidable subset of the Dedekind real numbers have decidable equality, but the constructive strict order meaning “less than” does not satisfy trichotomy, which is a very important theorem in classical mathematics.

    “This is why constructivism has few consequences for basic combinatorics and algebra (although it does have important consequences for more advanced topics in those fields).”

    There are also potentially other sets with decidable equality and a tight apartness not provably equivalent to the negation of equality. So this sentence isn’t true either - Heyting fields are still important in basic algebra here even for sets with decidable equality. (And if we’re talking about high school algebra - that is real analysis, so the third sentence of the paragraph arrives). One wants to work with decidable subsets of sets with decidable tight apartness to make algebra like that in classical mathematics.

    Thus, I will move the “Applications” section from this article to the decidable tight apartness article.

    Anonymouse

    diff, v19, current