Cogenerators for convex spaces

We give cogenerators for the categories of convex (= finitely superconvex), finitely positively convex, and absolute convex (= finitely totally convex) spaces introduced by Pumplün and Röhrl.Dedicated to our academic teacher Dieter Pumplün on the occasion of his sixtieth birthday.     

Domination of uniformly continuous semigroups

We prove that a bounded operator on a Banach lattice, satisfying a growth condition, is regular. Also, we prove that the generator of a C ₀-semigroup on such a lattice for which such an operator exists is bounded.     

Numerosities of labelled sets: a new way of counting

The notions of “labelled set” and “numerosity” are introduced to generalize the counting process of finite sets. The resulting numbers, called numerosities, are then used to develop nonstandard analysis. The existence of a numerosity function is equivalent to the existence of a selective ultrafilter, hence it is independent of the axioms of ZFC.     

Pullback attractors for a non-autonomous incompressible non-Newtonian fluid

This paper studies the pullback asymptotic behavior of solutions for a non-autonomous incompressible non-Newtonian fluid in two-dimensional (2D) bounded domains. We first prove the existence of pullback attractors AV in space V (has H²-regularity, see notation in Section 2) and AH in space H (has L²-regularity) for the cocycle corresponding to the solutions of the fluid. Then we verify the regularity of the pullback attractors by showing AV=AH, which implies the pullback asymptotic smoothing effect of the fluid in the sense that the solutions become eventually more regular than the initial data.     

A Universal Logic Approach to Adaptive Logics

In this paper, adaptive logics are studied from the viewpoint of universal logic (in the sense of the study of common structures of logics). The common structure of a large set of adaptive logics is described. It is shown that this structure determines the proof theory as well as the semantics of the adaptive logics, and moreover that most properties of the logics can be proved by relying solely on the structure, viz. without invoking any specific properties of the logics themselves.     

On Subspaces and Quotients of Banach Spaces C(K, X)

 We study the relation of to the subspaces and quotients of Banach spaces of continuous vector-valued functions , where K is an arbitrary dispersed compact set. More precisely, we prove that every infinite dimensional closed subspace of totally incomparable to X contains a copy of complemented in . This is a natural continuation of results of Cembranos-Freniche and Lotz-Peck-Porta. We also improve our result when K is homeomorphic to an interval of ordinals. Next we show that complemented subspaces (resp., quotients) of which contain no copy of are isomorphic to complemented subspaces (resp., quotients) of some finite sum of X. As a consequence, we prove that every infinite dimensional quotient of which is quotient incomparable to X, contains a complemented copy of . Finally we present some more geometric properties of spaces. Received 8 November 2000; in revised form 7 December 2001     

Interpreting Kullback-Leibler divergence with the Neyman-Pearson lemma

Kullback-Leibler divergence and the Neyman-Pearson lemma are two fundamental concepts in statistics. Both are about likelihood ratios: Kullback-Leibler divergence is the expected log-likelihood ratio, and the Neyman-Pearson lemma is about error rates of likelihood ratio tests. Exploring this connection gives another statistical interpretation of the Kullback-Leibler divergence in terms of the loss of power of the likelihood ratio test when the wrong distribution is used for one of the hypotheses. In this interpretation, the standard non-negativity property of the Kullback-Leibler divergence is essentially a restatement of the optimal property of likelihood ratios established by the Neyman-Pearson lemma. The asymmetry of Kullback-Leibler divergence is overviewed in information geometry.     

A characterization of the \Sigma_1-definable functions of KP\omega + (uniform\; AC)

The subject of this paper is a characterization of the -definable set functions of Kripke-Platek set theory with infinity and a uniform version of axiom of choice: . This class of functions is shown to coincide with the collection of set functionals of type 1 primitive recursive in a given choice functional and . This goal is achieved by a G?del Dialectica-style functional interpretation of and a computability proof for the involved functionals. Received October 9, 1996     

An isolic generalization of Cauchy's theorem for finite groups

In his note [5] Hausner states a simple combinatorial principle, namely:

Normal subgroups and elementary theories of lattice-ordered groups

We show that any lattice-ordered group (l-group) G can be l-embedded into continuously many l-groups H _i which are pairwise elementarily inequivalent both as groups and as lattices with constant e. Our groups H _i can be distinguished by group-theoretical first-order properties which are induced by lattice-theoretically nice properties of their normal subgroup lattices. Moreover, they can be taken to be 2-transitive automorphism groups A(S _i ) of infinite linearly ordered sets (S _i , ) such that each group A(S _i ) has only inner automorphisms. We also show that any countable l-group G can be l-embedded into a countable l-group H whose normal subgroup lattice is isomorphic to the lattice of all ideals of the countable dense Boolean algebra B.