The Past-Future Asymmetry

As the past-future asymmetry – that fact that we have records of the past but not the future – is still a puzzle the aim of this paper is twofold: a) to explain the asymmetry and its status in philosophy and physics and to critically review the proposed solutions to this puzzle; b) to advance a dynamic solution to the puzzle (which is lacking in alternative proposals) in terms of the ‘universality’ of the entropy relation in statistical mechanics

Presentational/Existential Structures in Spoken versus Written German: Es Gibt and SEIN

This article presents a synchronic, corpus-based examination of spoken German with regard to the distribution and function of presentational/ existential es gibt NP and a range of SEIN NP structures such as da SEIN , locative SEIN , es SEIN , and zero-locative SEIN . In particular, the use of da SEIN has been neglected in previous research. While es gibt is equally frequent in the spoken and written data, SEIN structures are typical of spoken German only, with da SEIN being the most frequent. The article concentrates on clauses with indefinite NPs, while the presentation of events with da and wider da-usage in spoken German are also considered

Lebesgue's Density Theorem and definable selectors for ideals

We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to these results, we show that there is no reasonably definable selector that chooses representatives for the equivalence relation on the Borel sets of having countable symmetric difference. In other words, there is no notion of density which makes the ideal of countable sets satisfy an analogue to the density theorem. The proofs of the positive results use only elementary combinatorics of trees, while the negative results rely on forcing arguments.Comment: 28 pages; minor corrections and a new introductio

Optical fluid and biomolecule transport with thermal fields

A long standing goal is the direct optical control of biomolecules and water for applications ranging from microfluidics over biomolecule detection to non-equilibrium biophysics. Thermal forces originating from optically applied, dynamic microscale temperature gradients have shown to possess great potential to reach this goal. It was demonstrated that laser heating by a few Kelvin can generate and guide water flow on the micrometre scale in bulk fluid, gel matrices or ice without requiring any lithographic structuring. Biomolecules on the other hand can be transported by thermal gradients, a mechanism termed thermophoresis, thermal diffusion or Soret effect. This molecule transport is the subject of current research, however it can be used to both characterize biomolecules and to record binding curves of important biological binding reactions, even in their native matrix of blood serum. Interestingly, thermophoresis can be easily combined with the optothermal fluid control. As a result, molecule traps can be created in a variety of geometries, enabling the trapping of small biomolecules, like for example very short DNA molecules. The combination with DNA replication from thermal convection allows us to approach molecular evolution with concurrent replication and selection processes inside a single chamber: replication is driven by thermal convection and selection by the concurrent accumulation of the DNA molecules. From the short but intense history of applying thermal fields to control fluid flow and biological molecules, we infer that many unexpected and highly synergistic effects and applications are likely to be explored in the future

Visibly Linear Dynamic Logic

We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words. In VLDL one can, e.g., express that a function resets a variable to its original value after its execution, even in the presence of an unbounded number of intermediate recursive calls. We prove that VLDL describes exactly the $\omega$-visibly pushdown languages. Thus it is strictly more expressive than LTL and able to express recursive properties of programs with unbounded call stacks. The main technical contribution of this work is a translation of VLDL into $\omega$-visibly pushdown automata of exponential size via one-way alternating jumping automata. This translation yields exponential-time algorithms for satisfiability, validity, and model checking. We also show that visibly pushdown games with VLDL winning conditions are solvable in triply-exponential time. We prove all these problems to be complete for their respective complexity classes.Comment: 25 Page