Oxygen reduction in acid media: influence of the heat treatment on the FeNPc(1–20 isomer mixture impregnated on carbon blacks and active charcoals
Oxygen reduction with the aid of a number of FeNPc(1–2) impregnated carbon supports in sulphuric acid solutions has been investigated. 
 
Loading of the carbon samples amounted to about 10 wt.%. After a 10 day stay in the aerated solutions the samples were investigated with rotating disk electrode and X-ray photoelectron spectroscopy techniques. The most active and stable samples correspond to mono- or submonolayers of FeNPc deposited on high dibutylphthalate adsorption carbon blacks. Comparison with data obtained previously on Norit BrX impregnations emphasizes the role of the electron density on the inner nitrogen atoms rather than that on the iron centres.
Oxygen reduction in acid media: effect of iron substitution by cobalt on heat-treated naphthalocyanine impregnations supported on preselected carbon blacks
FeNPc(1.2) impregnations were investigated at various loadings using a rotating-disk electrode, voltammetry and X-ray photoelectron spectroscopy (XPS) techniques. Optimal activity takes place at monolayer coverage, and major demetallation occurs after prolonged exposure to acid solution. The substitution of Fe by Co enables the electrochemical performances to reach those presented by 10% Pt on Vulcan and stops the demetallation process. The application of fast atomic bombardment secondary ion mass spectrometry (FABS) together with XPS sheds light on the detrimental role of some electrophilic groups attached to the carbon black-catalyst interface.
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.