Not signed in (Sign In)

Start a new discussion

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-categories 2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry beauty bundles calculus categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology combinatorics complex-geometry computable-mathematics computer-science connection constructive constructive-mathematics cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry differential-topology digraphs duality education elliptic-cohomology enriched fibration finite foundations functional-analysis functor galois-theory gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck 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 infinity integration integration-theory k-theory lie lie-theory limits linear linear-algebra locale localization logic manifolds mathematics measure-theory modal-logic model model-category-theory monad monoidal monoidal-category-theory morphism motives motivic-cohomology multicategories noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pasting philosophy physics planar 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 simplicial space spin-geometry stable-homotopy-theory stack string-theory subobject superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory 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).
    • What is a weakly separated space ?

      Anonymous

      v1, current

    • This is my first hook to the n-lab, I am pretty sure that isomorphism is an overly strong condition, and that any is a too weak restriction.

      Please see the wikipedia article on the principle of bivalence. https://en.wikipedia.org/wiki/Principle_of_bivalence

      I am unsure as how to proceeed.

      vukovinski

      diff, v4, current

    • Changed requiring that all j-morphisms are invertible to demand being equivalences as in infinity-groupoid entry.

      diff, v10, current

    • Page created, but author did not leave any comments.

      vukovinski

      v1, current

    • Page created, but author did not leave any comments.

      Anonymous

      v1, current

    • I added a couple of references for the claim

      There is a Curry–Howard correspondence between linear-time temporal logic (LTL) and functional reactive programming (FRP).

      How about for CLT and CLT* (in the computation tree logic section)?

      Were we looking to integrate this section with the one above on temporal type theory as an adjoint logic, could there be a way via some branching representation of our type TimeTime as a tree?

      I see Joachim Kock has an interesting way of presenting trees.

      diff, v18, current

    • I added to excluded middle a discussion of the constructive proof of double-negated LEM and how it is a sort of “continuation-passing” transform.

    • starting something, but I am running out of steam now

      v1, current

    • table for inclusion as floating TOCs

      v1, current

    • am starting some minimum here. Have been trying to read up on this topic. This will likely become huge towards beginning of next year

      v1, current

    • Added a definition of meager sets.

      v1, current

    • Page created, but author did not leave any comments.

      v1, current

    • Page created, but author did not leave any comments.

      v1, current

    • in order to have a good place to record the diagram:

      (q 1,q 2) (xq 1xq¯ 2) Sp(1)×Sp(1) Spin(4) Sp(1)Sp(1) SO(4) \array{ ( q_1, q_2 ) &\mapsto& (x \mapsto q_1 \cdot x \cdot \overline{q}_2) \\ Sp(1) \times Sp(1) &\overset{\simeq}{\longrightarrow}& Spin(4) \\ \big\downarrow && \big\downarrow \\ Sp(1)\cdot Sp(1) &\overset{\simeq}{\longrightarrow}& SO(4) }

      v1, current

    • corrected the reference to point to the right publication

      diff, v4, current

    • Page created, but author did not leave any comments.

      v1, current

    • Should we replace "to all the elements in the set" with "to all the elements in the subset" at meet's definition?

      > In a preordered set or partially ordered set then the meet or infimum of a subset of elements is, if it exists, the largest element which is smaller or equal to all the elements in the set. If this element is member of the original subset, then it is also called the minimum of that subset.

      https://ncatlab.org/nlab/show/meet

      Thank you!