The Singularity in Generic Gravitational Collapse Is Spacelike, Local, and Oscillatory

A longstanding conjecture by Belinskii, Khalatnikov, and Lifshitz that the singularity in generic gravitational collapse is spacelike, local, and oscillatory is explored analytically and numerically in spatially inhomogeneous cosmological spacetimes. With a convenient choice of variables, it can be seen analytically how nonlinear terms in Einstein's equations control the approach to the singularity and cause oscillatory behavior. The analytic picture requires the drastic assumption that each spatial point evolves toward the singularity as an independent spatially homogeneous universe. In every case, detailed numerical simulations of the full Einstein evolution equations support this assumption.Comment: 7 pages includes 4 figures. Uses Revtex and psfig. Received "honorable mention" in 1998 Gravity Research Foundation essay contest. Submitted to Mod. Phys. Lett.

Hunting Local Mixmaster Dynamics in Spatially Inhomogeneous Cosmologies

Heuristic arguments and numerical simulations support the Belinskii et al (BKL) claim that the approach to the singularity in generic gravitational collapse is characterized by local Mixmaster dynamics (LMD). Here, one way to identify LMD in collapsing spatially inhomogeneous cosmologies is explored. By writing the metric of one spacetime in the standard variables of another, signatures for LMD may be found. Such signatures for the dynamics of spatially homogeneous Mixmaster models in the variables of U(1)-symmetric cosmologies are reviewed. Similar constructions for U(1)-symmetric spacetimes in terms of the dynamics of generic $T^2$-symmetric spacetime are presented.Comment: 17 pages, 5 figures. Contribution to CQG Special Issue "A Spacetime Safari: Essays in Honour of Vincent Moncrief

Program logics for homogeneous meta-programming.

A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Meta-programming has been used extensively since macros were introduced to Lisp, yet we have little idea how formally to reason about metaprograms. This paper provides the first program logics for homogeneous metaprogramming – using a variant of MiniMLe by Davies and Pfenning as underlying meta-programming language.We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics