Processing math: 100%
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 definitions 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 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).
    • Page created, but author did not leave any comments.

      Anonymous

      v1, current

    • Missing page, just a definition

      v1, current

    • made sub-sections for the different definitions; slightly expanded the definition in terms of differential forms (here)

      diff, v14, current

    • have re-touched the formatting of this ancient entry from the early days of the nLab, and added hyperlinks and cross-links

      diff, v5, current

    • minimum on the multicategory of permutative categories, for the moment just as to record references and make hyperlinks work

      v1, current

    • Included some links to his theses and a start on his papers.

      diff, v3, current

    • added a tad more text, to make this a tad more useful to a reader not already familiar with it. But it’s still a stub

      diff, v3, current

    • discovered this ancient entry (while searching for occurences of “permutation matrix” on the nLab). This was in very bad shape, with a ill-rendering floating toc and big query box right at the beginning, then a little bit of content, and then some speculation by a contributor who we had to persuade to leave, long ago.

      I did a minimum of cleaning up, in particular removed the query box, since it had been dealt with. This is what it had said:


      +– {.query}

      Zoran: there are several things called “Birkhoff’s theorem” in various field of mathematics and mathematical physics, and belong even to at least 2 different classical Birkhoff’s. Even wikipedia has pages for more than one such theorem. To me the first which comes to mind is Birkhoff’s factorization theorem, now also popular in Kreimer-Connes-Marcolli work and in connection to loop groups (cf. book by Segal nad Pressley). I would like that the nlab does not mislead by distinguishing one of the several famous Bikhoff labels without mentioning and directing to 2-3 others.

      Ian Durham: Good point. I think this probably ought to be renamed the “Birkhoff-von Neumann theorem.” Is that a good enough label or should we get more specific with it?

      Toby: I have moved it. See also the new page Birkhoff’s theorem, which is basically just Zoran's comment above. =–


      diff, v9, current

    • stub entry, for the moment just so as to make cross-links work

      v1, current

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

      v1, current

    • stub entry, for the moment just so as to record the reference: the analog of Atiyah-Segal completion, but now for algebraic K-theory over a finite field.

      v1, current

    • Added more publications and preprints to Steve Lack’s page

      diff, v5, current

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

      v1, current

    • added the crucial pointer to

      • Gunnar Carlsson, Equivariant Stable Homotopy and Segal’s Burnside Ring Conjecture, Annals of Mathematics Second Series, Vol. 120, No. 2 (Sep., 1984), pp. 189-224 (jstor:2006940, pdf)

      and a bit more

      diff, v3, current

    • Consistency in style of binary vs nullary rule, consistency of notation between binary and nullary multiplicative conjunction.

      diff, v2, current

    • I have slightly expanded, reorganized and polished the entry state. (Added definition of classical state in Heisenberg picture, added pointer to the entry classical state, moved pointers to quasi-state and state in AQFT and operator algebra to the paragraph on quantum states and added at the very end a list of “related concepts” in an attempt to organize what used to be somewhat of a mess here). But this entry deserves to be polished and organized and expanded still more.

    • created a stub entry topological recursion in order to record some references, and added cross-links with various related entries

    • Make Lie ideals a special case of the general definition for rings (and the like).

      diff, v23, current

    • Added a reference to plane graph. (Started this thread since it appear not to have had one.)

    • We don’t have anything on this, I think, but there is mention of “intrinsic” and “à la Church” at coercion. From Type refinement and monoidal closed bifibrations:

      One of the difficulties in giving a clear mathematical definition of the “topic” of type theory is that the word “type” is actually used with two very different intuitive meanings and technical purposes in mind:

      1. Like the syntactician’s parts of speech, as a way of defining the grammar of well-formed expressions.
      2. Like the semanticist’s predicates, as a way of identifying subsets of expressions with certain desirable properties.

      These two different views of types are often associated respectively with Alonzo Church and Haskell Curry (hence “types à la Church” and “types à la Curry”), while the late John Reynolds referred to these as the intrinsic and the extrinsic interpretations of types [11]. In the intrinsic view, all expressions carry a type, and there is no need (or even sense) to consider the meaning of “untyped” expressions; while in the extrinsic view, every expression carries an independent meaning, and typing judgments serve to assert some property of that meaning.

      [11] is John C. Reynolds. The Meaning of Types: from Intrinsic to Extrinsic Semantics. BRICS Report RS-00-32, Aarhus University, December 2000. pdf

      There are two very different ways of giving denotational semantics to a programming language (or other formal language) with a nontrivial type system. In an intrinsic semantics, only phrases that satisfy typing judgements have meanings. Indeed, meanings are assigned to the typing judgements, rather than to the phrases themselves, so that a phrase that satisfies several judgements will have several meanings.

      In contrast, in an extrinsic semantics, the meaning of each phrase is the same as it would be in a untyped language, regardless of its typing properties. In this view, a typing judgement is an assertion that the meaning of a phrase possesses some property.

      The terms “intrinsic” and “extrinsic” are recent coinages by the author [1, Chapter 15], but the concepts are much older. The intrinsic view is associated with Alonzo Church, and has been called “ontological” by Leivant [2]. The extrinsic view is associated with Haskell Curry, and has been called “semantical” by Leivant.

      [1] John C. Reynolds. Theories of Programming Languages. Cambridge University Press, Cambridge, England, 1998. [2] Daniel Leivant. Typing and computational properties of lambda expressions. Theoretical Computer Science, 44(1):51–68, 1986.

      Anyone have a preferred name for this distinction?

    • I edited subobject slightly and added the statement that in an accessible category C every poset of subobjects is small.

    • added three references, as per Harry’s request here. But it remains very incomplete

      diff, v2, current

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

      v1, current

    • Tried to make some improvements. Gave a formal definition of a link diagram (surprisingly difficult to find a fully rigorous one in the literature). Reorganised some of the earlier content.

      Lacks a discussion of how to obtain a link from a link diagram.

      diff, v7, current

    • Am making little polishings. Remarkably, thanks to Richard’s work, it is now feasible to edit this large entry on a phone, over a beer. A new era of nLab usage.

      diff, v32, current

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

      Younesse Kaddar

      v1, current

    • started a minimum Idea-section, so far just a stub entry in order to un-gray links in other entries.

      v1, current

    • Removed by admin.

    • Created a stub for this to ’ungrey’some links.

      v1, current

    • Began working on a write up of the material presented in #1 at this nForum post. I will use it as well to experiment with introduction of further Tex style commands (the aim is for the page to compile as-is into LaTex), and to work on relevant nLab pages on knot theory (beginning with link diagram earlier today).

    • went ahead and collected together some links for a combinatorics context side bar.

      v1, current

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

      v1, current

    • link to wikipedia page on Kuiper.

      v1, current