On a variational formula for the H. Weyl curvature invariants
We use the ring of curvature structures, to answer a question of M. Berger about a variational formula for the H. Weyl curvature invariants. Recall that the (2k)-H. Weyl curvature invariant is a polynomial of degree 2k with respect to the Riemannian curvature. In dimension 2k it is just the Gauss-Bonnet integrand, in higher dimensions it appears naturally, as an integrand, in the well known H. Weyl’s tube formula. Mathematics Subject Classification (2000). 58E11, 58C99.
Double forms, curvature structures and the $(p,q)$-curvatures
We introduce a natural extension of the metric tensor and the Hodge star operator to the algebra of double forms to study some aspects of the structure of this algebra. These properties are then used to study new Riemannian curvature invariants, called the (p, q)-curvatures. They are a generalization of the p-curvature obtained by substituting the Gauss-Kronecker tensor to the Riemann curvature tensor. In particular, for p = 0, the (0, q)-curvatures coincide with the H. Weyl curvature invariants, for p = 1 the (1, q)-curvatures are the curvatures of generalized Einstein tensors, and for q = 1 the (p, 1)-curvatures coincide with the p-curvatures. Also, we prove that the second H. Weyl curvature invariant is nonnegative for an Einstein manifold of dimension n > 4, and it is nonpositive for a conformally flat manifold with zero scalar curvature. A similar result is proved for the higher H. Weyl curvature invariants.
Decidability of some intuitionistic predicate theories
Suppose T is a first order intuitionistic theory (more precisely, a theory of Heyting's predicate calculus, e.g., abelian groups, one unary function, dense linear order, etc.) presented to us by a set of axioms (denoted also by) T. Question. Is T decidable? One knows that if the classical counterpart of T (i.e., take the same axioms but with the classical predicate calculus as the underlying logic) is not decidable, then T cannot be decidable. The problem remains for theories whose classical counterpart is decidable. In [8], sufficient conditions for undecidability were given, and several intuitionistic theories such as abelian groups and unary functions (both with decidable equality) were shown to be undecidable. In this note we show decidability results (see Theorems 1 and 2 below), and compare these results with the undecidability results previously obtained. The method we use is the reduction-method, described fully in [12] and widely applied in [3], which is applied here roughly as follows: Let T be a given theory of Heyting's predicate calculus. We know that Heyting's predicate calculus is complete for the Kripke-model type of semantics. We choose a class M of Kripke models for which T is complete, i.e., all axioms of T are valid in any model of the class and whenever φ is not a theorem of T, φ is false in some model of M.