Constraints on the effective fluid theory of stationary branes

We develop further the effective fluid theory of stationary branes. This formalism applies to stationary blackfolds as well as to other equilibrium brane systems at finite temperature. The effective theory is described by a Lagrangian containing the information about the elastic dynamics of the brane embedding as well as the hydrodynamics of the effective fluid living on the brane. The Lagrangian is corrected order-by-order in a derivative expansion, where we take into account the dipole moment of the brane which encompasses finite-thickness corrections, including transverse spin. We describe how to extract the thermodynamics from the Lagrangian and we obtain constraints on the higher-derivative terms with one and two derivatives. These constraints follow by comparing the brane thermodynamics with the conserved currents associated with background Killing vector fields. In particular, we fix uniquely the one- and two-derivative terms describing the coupling of the transverse spin to the background space-time. Finally, we apply our formalism to two blackfold examples, the black tori and charged black rings and compare the latter to a numerically generated solution.

A feasible theory of truth over combinatory algebra

We define an applicative theory of truth TPT which proves totality exactly for the polynomial time computable functions. TPT has natural and simple axioms since nearly all its truth axioms are standard for truth theories over an applicative framework. The only exception is the axiom dealing with the word predicate. The truth predicate can only reflect elementhood in the words for terms that have smaller length than a given word. This makes it possible to achieve the very low proof-theoretic strength. Truth induction can be allowed without any constraints. For these reasons the system TPT has the high expressive power one expects from truth theories. It allows embeddings of feasible systems of explicit mathematics and bounded arithmetic. The proof that the theory TPT is feasible is not easy. It is not possible to apply a standard realisation approach. For this reason we develop a new realisation approach whose realisation functions work on directed acyclic graphs. In this way, we can express and manipulate realisation information more efficiently.