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.
    • CommentAuthorTim_Porter
    • CommentTimeOct 19th 2010

    I found in one of the modal logic sources the following

    Necessity = truth in all possible worlds

    Possibility = truth in some possible world.

    Discuss. :-)

    • CommentRowNumber2.
    • CommentAuthorTodd_Trimble
    • CommentTimeOct 20th 2010

    Yes, this would be a good thing to discuss, for example in conjunction with Awodey-Kinisha. Hopefully soon!

    • CommentRowNumber3.
    • CommentAuthorUlrik
    • CommentTimeOct 20th 2010

    You’re thinking it looks circular? Well, doesn’t it go like this?

    Necessity = truth in all possible worlds,

    Contingency = truth in some possible world.

    As for what is a possible world, that’s another question. A possible (:-)) answer begins: “Consider a Kripke model (W,R,)(W,R,\Vdash)…”

    • CommentRowNumber4.
    • CommentAuthorTobyBartels
    • CommentTimeOct 21st 2010

    I never understand how this was supposed to make sense of sentences like p\diamond \square p. Even pp\diamond p \Rightarrow p seems like a type mismatch to me.

    I mean, I can read about and understand modal logics. It just has nothing to do with my intuition about alternative worlds.

    @ Urs:

    No, contingency = truth in some possible world but not in all possible worlds. That is, it’s contingent iff it’s possible but unnecessary.

    • CommentRowNumber5.
    • CommentAuthorTim_Porter
    • CommentTimeOct 21st 2010

    My understanding, such as it is came, by looking at multiagent systems and the Muddy Children problem. To start with in that problem there are loots of worlds that may be possible but as the recursion happens this narrows down, but in a subtle non=deterministic way. Understanding that argument is very hard I think. The action on the models of the recursion seems to me to require a lot more study than is usually given to it in books.