An approach to infinitary temporal proof theory

Aim of this work is to investigate from a proof-theoretic viewpoint a propositional and a predicate sequent calculus with an –type schema of inference that naturally interpret the propositional and the predicate until–free fragments of Linear Time Logic LTL respectively. The two calculi are based on a natural extension of ordinary sequents and of standard modal rules. We examine the pure propositional case (no extralogical axioms), the propositional and the first order predicate cases (both with a possibly infinite set of extralogical axioms). For each system we provide a syntactic proof of cut elimination and a proof of completeness.Supported by MIUR COFIN 02 Teoria dei Modelli e Teoria degli Insiemi, loro interazioni ed applicazioni.Supported by MIUR COFIN 02 PROTOCOLLO.Mathematics Subject Classification (2000):03B22, 03B45, 03F05     

Optimal transformations for prediction in continuous-time stochastic processes: finite past and future

In the classical Wiener-Kolmogorov linear prediction problem, one fixes a linear functional in the future of a stochastic process, and seeks its best predictor (in the L²-sense). In this paper we treat a variant of the prediction problem, whereby we seek the most predictable non-trivial functional of the future and its best predictor; we refer to such a pair (if it exists) as an optimal transformation for prediction. In contrast to the Wiener-Kolmogorov problem, an optimal transformation for prediction may not exist, and if it exists, it may not be unique. We prove the existence of optimal transformations for finite past and future intervals, under appropriate conditions on the spectral density of a weakly stationary, continuous-time stochastic process. For rational spectral densities, we provide an explicit construction of the transformations via differential equations with boundary conditions and an associated eigenvalue problem of a finite matrix.This research was partially supported by ARO (MURI grant) DAAH04-96-1-0445, NSF grant DMS-0074276, and CNPq grant 301179/00-0.     

Subsets with Restricted Movement

Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = max_gG| ^g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .     

‘Outside’ as a primitive notion in constructive projective geometry

In intuitionistic (or constructive) geometry there are positive counterparts, apart and outside, of the relations = and incident. In this paper it is shown that the relation outside suffices to define incident, apart and equality. The equivalence of the new system with Heyting's system is shown and as a simple corollary one obtains duality for intuitionistic projective geometry.     

Weak solutions of the Stokes problem in weighted Sobolev spaces

For n2 we consider the Stokes problem in ⁿ, -u + p=f, -divu=g, in weighted Soboiev spaces H ₆ ^m,r , where the weights are proportional to (1+|x|). We prove the existence of weak solutions for any K, whereK is a discrete set of critical values. Furthermore, we characterize the solutions of the homogeneous problem.This research was supported by the DFG research group Equations of Hydrodynamics, Universities of Bayreuth and Paderborn.     

Stationary Solutions of the Fractional Kinetic Equation with a Symmetric Power-Law Potential

The properties of stationary solutions of the one-dimensional fractional Einstein--Smoluchowski equation with a potential of the form x ^2m+2, m=1,2,..., and of the Riesz spatial fractional derivative of order , 12, are studied analytically and numerically. We show that for 1<2, the stationary distribution functions have power-law asymptotic approximations decreasing as x ^–(+2m+1) for large values of the argument. We also show that these distributions are bimodal.     

Experiments with an interactive paired comparison simplex method for molp problems

In this paper, an interactive paired comparison simplex based method formultipleobjectivelinearprogramming (MOLP) problems is developed and compared to other interactive MOLP methods. Thedecisionmaker (DM)'s utility function is assumed to be unknown, but is an additive function of his known linearized objective functions. A test for utilityefficiency for MOLP problems is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion of strength ofpreference is developed for the assessment of the DM's unknown utility function where he can express his preference for a pair of extreme points as strong, weak, or almost indifferent. The problem of inconsistency of the DM is formalized and its resolution is discussed. An example of the method and detailed computational results comparing it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive multiple objective programming methods are also discussed.All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors.     

On cubature formulas on the basis of lattices

Q (.. , L). Q . P(S_r(2)) — 2 (S _r(2) (r — ). , M(P(S _r(m=sup{t(·)t(·)₁:t P(S _r(2)),t 0}. , /4+(1)M(P(S _r(2)))/r ²15/17+(1)(r+). (Q), Q L.     

A new example of ‘independence’ and ‘white noise’

Summary We examine the notion of free independence according to Voiculescu. This form of independence is used for defining free white noise or process with stationary and freely independent increments. We prove a general limit theorem giving the combinatorics of infinitely freely divisible states and thus of free white noises with the help of admissible partitions. We realize the free analogues of the Wiener process and of the Poisson process as processes on the full Fock space ofL ² (—).     

О Тригонометрическом (0, 2)-Интерполировании

.      

Hulls for Various Kinds of α-Completeness in Archimedean Lattice-Ordered Groups

Within Archimedean -groups, and with an infinite cardinal or , we consider X-hulls where X stands for any of the following classes of -groups: -projectable; laterally -complete; boundedly laterally -complete; conditionally -complete; combinations of the preceding, together with divisibility and/or relative uniform completeness. All these hulls exist, and may be obtained by iterated adjunction of the required extra elements, within the essential hull. When the -groups is relatively -complemented one step in the iteration suffices for several crucial properties. We derive from the above a considerable number of equations involving combinations of these hull operators.     

Spectral orders and convolution

. (R) _{– –} fg(y)h(x–y) dx dy _{– –} f ^{^} (x)g ^{^} (y)h ^{^} (x–y)dx dy (f,g0) —:f×gf ^{^} ×g ^{^}(f,g 0) f^{^} g^{^} f g -, X — . , - f ₁f ₂ , f ₁ ^{^} ×gf ₂×g 0g. .     

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> estimates for the biest I. The Walsh case

We prove L^p estimates (Theorem 1.8) for the Walsh model of the biest, a trilinear multiplier with singular symbol. The corresponding estimates for the Fourier model will be obtained in the sequel [11] biest of this paper.     

Equivalence Bimodule Between Non-Commutative Tori

The non-commutative torus C ^*(ⁿ,) is realized as the C*-algebra of sections of a locally trivial C*-algebra bundle over S with fibres isomorphic to C ^*n/S, ₁) for a totally skew multiplier ₁ on ⁿ/S. D. Poguntke [9] proved that A is stably isomorphic to C(S) C(^*( Zⁿ/S, ₁) C(S) A M_kl( C) for a simple non-commutative torus A and an integer kl. It is well-known that a stable isomorphism of two separable C*-algebras is equivalent to the existence of equivalence bimodule between them. We construct an A-C(S) A-equivalence bimodule.     

OnU ϕ-sets of trigonometric integrals

, (t) >0 E(–, +),E<, , ¦f(t)¦ (t) xE, f(t)=0 (–, +).     

Transient solution for a finite capacity M/G a,b /1 queueing system with vacations to the server

In this paper we consider a single server queueing system with Poisson input, general service and a waiting room that allows only a maximum of b customers to wait at any time. A minimum of a customers are required to start a service and the server goes for a vacation whenever he finds less than a customers in the waiting room after a service. If the server returns from a vacation to find less than a customers waiting, he begins another vacation immediately. Using the theory of regenerative processes we derive expressions for the time dependent system size probabilities at arbitrary epochs.     

Criteria for the Boundedness and Compactness of Operators with Power-Logarithmic Kernels

In the present work, necessary and sufficient conditions are given in terms of a nonnegative Borel measure which ensure the boundedness and compactness of operators with power-logarithmic kernels from L ^p (0, a) to L ^p (0, a) (or to L ^q (0, a)), where 0 < a < , 1 < p, q < , > 1/p and 0.     

Ultrafilter translations

We develop a method for extending results about ultrafilters into a more general setting. In this paper we shall be mainly concerned with applications to cardinality logics. For example, assumingV=L, Gödel's Axiom of Constructibility, we prove that if > then the logic with the quantifier there exist many is (,)-compact if and only if either is weakly compact or is singular of cofinality<. As a corollary, for every infinite cardinals and , there exists a (,)-compact non-(,)-compact logic if and only if either < orcf<cf or < is weakly compact.Counterexamples are given showing that the above statements may fail, ifV=L is not assumed.However, without special assumptions, analogous results are obtained for the stronger notion of [,]-compactness.     

Discrete Spectrum of Differential Operators in Spectral Gaps under Nonnegative Perturbations of High Order

Let A be a self-adjoint elliptic second-order differential operator, let (, ) be an inner gap in the spectrum of A, and let B(t) = A + tW ^* W, where W is a differential operator of higher order. Conditions are obtained under which the spectrum of the operator B(t) in the gap (, ) is either discrete, or does not accumulate to the right-hand boundary of the spectral gap, or is finite. The quantity N(, A, W, ), (, ), > 0 (the number of eigenvalues of the operator B(t) passing the point (, ) as t increases from 0 to ) is considered. Estimates of N(, A, W, ) are obtained. For the perturbation W ^* W of a special form, the asymptotics of N(, A, W, ) as + is given. Bibliography: 5 titles.     

Lacunary (0; 0, 1) interpolation on the roots of Jacobi polynomials and their derivatives,respectively. I (Existence,explicit formulae,unicity)

(0; 0, 1) , {x _k <x _k ^* <x _k+1} _k=1 ^n–1 {x _{k k=1} ⁿ }., I, , _n (x)=P _n ^{(, )} (x)–n- , =, n3 . , x ₀=+1 x _n+1= –1. II .

---

---

To the memory of Paul Erds

---

The research was supported by the Hungarian National Foundation for Scientific Research under Grant # T 914 244.