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 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 nforum 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.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012
    • (edited Sep 2nd 2012)
    • CommentRowNumber2.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012

    Of course, now I need to write premise and deduction, since I used them. Also identity rule and cut rule, since I listed them.

    • CommentRowNumber3.
    • CommentAuthorMike Shulman
    • CommentTimeSep 2nd 2012

    Thanks. Linked back and forth to substructural logic.

    I might take issue with calling cut a structural rule, and perhaps identity too. Certainly cut plays a vey different role in logic than the other structural rules.

    • CommentRowNumber4.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012

    Thanks, I was surprised that we didn’t already have structural rule; I must have been remembering substructural logic.

    Cut and identity go together; they form a binary/nullary pair and can both be eliminated (except atomic instances of identity). Wikipedia calls them structural rules and they fit the definition of not involving connectives, but they are different from the others.

    • CommentRowNumber5.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 2nd 2012

    You know, the nomenclature here has always seemed a tad bizarre to me, viz. “structural” rules vs. “logical” rules. Why is say exchange considered ’structural’ and say an introduction rule for a connective ’logical’? Aren’t connectives structure? (They sure are in linear logic!) In any case, it would make just as much if not more sense to me if these adjectives were completely reversed in their roles.

    • CommentRowNumber6.
    • CommentAuthorMike Shulman
    • CommentTimeSep 2nd 2012

    @Todd, I think one way to think of it is that semantically, structural rules correspond to the defining structure and axioms of the type of category you consider. In nonlinear nondependent type theory, that’s a cartesian multicategory: cut and identity are composition of multimorphims, while exchange, weakening, and contraction are reindexing of the domains of multimorphisms. Then the formation, introduction, elimination, and computation rules for types/connectives are about characterizing objects in such a categorical structure via universal properties.

    I don’t think I have any opinion on the suitability of the particular adjectives ’structual’ and ’logical’ to their assigned meanings, but I think the fact of a separation makes sense.

    • CommentRowNumber7.
    • CommentAuthorTobyBartels
    • CommentTimeSep 2nd 2012

    These two names have never made much sense to me either, but they are pretty well established.

    • CommentRowNumber8.
    • CommentAuthorTodd_Trimble
    • CommentTimeSep 2nd 2012

    @Mike #6: of course I do see the point about separating into two classes of rules this way, but I wasn’t asking about that. To me, it would make just as much if not more sense to call the reindexing of domains of multimorphisms “logical”, or refer to the “ambient logic” of the type of multicategory one is considering as cartesian, linear, or whatever. And in the semantics, where one must inevitably choose which objects play the role of sums, products, etc. – that’s property-like structure.

    As Toby says, the terminology is old (probably goes back to Gentzen) and well-established – I wasn’t proposing we do anything about it. I just didn’t understand what Gentzen’s (or whoever’s) reasons were, and I still find it a bit odd. (But it was only a little mini-rant, and I’m done. Please, carry on, as you were! (-: )

    • CommentRowNumber9.
    • CommentAuthorMike Shulman
    • CommentTimeSep 3rd 2012

    Okay, sorry I misunderstood your comment. As I said, I agree that the terminology is pretty arbitrary.