Indexical beliefs pose a special problem for standard theories of bayesian updating. Sometimes we are uncertain about our location in time and space. How are we to update our beliefs in situations like these? In a stepwise fashion, I develop a constraint on the dynamics of indexical belief. As an application, the suggested constraint is brought to bear on the Sleeping Beauty problem.

In this paper, the effect of anisotropy on the free vibration of laminated rectangular plate supporting a localized patch mass is investigated. The two variable refined plate theory is applied to define the third order displacement field of a composite rectangular plate. The plate is considered to have simply supported boundaries. The equations of motion for rectangular plate are obtained by ca...

The three-dimensional shapes of thin lamina, such as leaves, flowers, feathers, wings, etc., are driven by the differential strain induced by the relative growth. The growth takes place through variations in the Riemannian metric given on the thin sheet as a function of location in the central plane and also across its thickness. The shape is then a consequence of elastic energy minimization on...

Consider a sequential programming language with control flow constructs such as assignments, choice, loops, and procedure calls. We restrict the syntax of expressions in this language to one that can be efficiently decided by a satisfiability-modulo-theories solver. For such a language, we define the problem of deciding whether a program can reach a particular control location as the reachabili...

The Sleeping Beauty problem is test stone for theories about selflocating belief, i.e. theories about how we should reason when data or theories contain indexical information. Opinion on this problem is split between two camps, those who defend the “1/2 view” and those who advocate the “1/3 view”. I argue that both these positions are mistaken. Instead, I propose a new “hybrid” model, which avo...

Consider a sequential programming language with control flow constructs such as assignments, choice, loops, and procedure calls. We restrict the syntax of expressions in this language to one that can be efficiently decided by a satisfiability-modulo-theories solver. For such a language, we define the problem of deciding whether a program can reach a particular control location as the reachabili...

The Sleeping Beauty problem is test stone for theories about self-locating belief, i.e. theories about how we should reason when data or theories contain indexical information. Opinion on this problem is split between two camps, those who defend the “1/2 view” and those who advocate the “1/3 view”. I argue that both these positions are mistaken. Instead, I propose a new “hybrid” model, which av...