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     

<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.     

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.     

Conformal spaces

A conformal space is a non-singular metric vector space to which has been adjoined a null-cone of points at infinity. We define a conformal space in terms of a higher dimensional coordinate space, and then state and prove a fundamental theorem of conformal geometry.     

Invariant Subspaces for Positive Operators Acting on a Banach Space with Markushevich Basis

We introduce weak quasinilpotence for operators. Then, by substituting Markushevich basis and weak quasinilpotence at a nonzero vector for Schauder basis and quasinilpotence at a nonzero vector, respectively, we answer a question on the invariant subspaces of positive operators in [3].     

The Hyperbell Algorithm for Global Optimization: A Random Walk Using Cauchy Densities

This article presents a new algorithm, called theHyperbell Algorithm, that searches for the global extrema ofnumerical functions of numerical variables. The algorithm relies on theprinciple of a monotone improving random walk whose steps aregenerated around the current position according to a gradually scaleddown Cauchy distribution. The convergence of the algorithm is provenand its rate of convergence is discussed. Its performance is tested onsome hard test functions and compared to that of other recentalgorithms and possible variants. An experimental study of complexityis also provided, and simple tuning procedures for applications areproposed.     

Augmented non-quadratic penalty algorithms

Auslender, Cominetti and Haddou have studied, in the convex case, a new family of penalty/barrier functions. In this paper, we analyze the asymptotic behavior of augmented penalty algorithms using those penalty functions under the usual second order sufficient optimality conditions, and present order of convergence results (superlinear convergence with order of convergence 4/3). Those results are related to the analysis of pure penalty algorithms, as well as augmented penalty using a quadratic penalty function. Limited numerical examples are presented to appreciate the practical impact of this local asymptotic analysis.This research was partially supported by NSERC grant OGP0005491     

Croissance lineaire et géométrie bornée

We show that on a noncompact manifold which has finite topology at infinity, there exists a Riemannian metric with bounded geometry and linear growth-type.     

Some New Transversality Properties

The theorems of Ceva and Menelaus are concerned with cyclic products of ratios of lengths of collinear segments of triangles or more general polygons. These segments have one endpoint at a vertex of the polygon and one at the intersection point of a side with a suitable line. To these classical results we have recently added a selftransversality theorem in which the suitable line is determined by two other vertices. Here we present additional transversality properties in which the suitable line is determined either by a vertex and the intersection point of two diagonals, or by the intersection points of two pairs of such diagonals. Unexpectedly it turns out that besides several infinite families of systematic cases there are also a few sporadic cases.     

Designs and partial geometries over finite fields

Let be a finite field, and let (, B) be a nontrivial 2-(n, k, 1)-design over . Then each point induces a (k–1)-spread S on /. (, B) is said to be a geometric design if S is a geometric spread on / for each . In this paper, we prove that there are no geometric designs over any finite field .Research partially supported by NSF grant DMS-8703229.     

Chains and Trees: ‘Strong’–‘Weak’ Order in Job Scheduling

We present a summary of recent NP-hardness and polynomial time solvability results for the distinction between strong and weak precedence for chains and trees in scheduling. We distinguish between chains and proper trees which are not chains, and demonstrate that the strong-weak precedence distinction for chains is not inclusive with regards to NP-hardness, and conjecture that the same holds for strong-weak tree precedence. The objective is to show that different interpretations for chain and tree order relations in scheduling might have far reaching computational implications.     

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.     

The nevanlinna factorization in certain classes of analytic functions

It is announced that in the classes H _n ^p , 0 pz+, 0 <l/.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 126, pp. 205–207, 1983.     

Central Limit Theorems for dependent variables. I

Summary This paper gives a flexible approach to proving the Central Limit Theorem (C.L.T.) for triangular arrays of dependent random variables (r.v.s) which satisfy a weak mixing condition called -mixing. Roughly speaking, an array of real r.v.s is said to be -mixing if linear combinations of its past and future are asymptotically independent. All the usual mixing conditions (such as strong mixing, absolute regularity, uniform mixing, -mixing and -mixing) are special cases of -mixing. Linear processes are shown to be -mixing under weak conditions. The main result makes no assumption of stationarity. A secondary result generalises a C.L.T. that Rosenblatt gave for strong mixing samples which are nearly second order stationary.     

Foundational Isomorphisms in Continuous Differentiation Theory

We provide an elementary proof of existence for the Foundational Isomorphism in each of the categories of convergence spaces, compactly generated topological spaces and sequential convergence spaces. This isomorphism embodies the germ of differentiation and its inverse the germ of integration.     

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.     

On the problem of two linearized wells

We study the behaviour of sequences of elastic deformationsy ^{n n} whose gradients approach two linearized wells, and give an application to magnetostriction.This article was processed by the author using the style filepljour1m from Springer-Verlag.     

Spectral properties and asymptotic periodicity of flows in networks

We combine functional analytical and graph theoretical methods in order to study flows in networks. We show that these flows can be described by a strongly continuous operator semigroup on a Banach space. Using Perron-Frobenius spectral theory we then prove that this semigroup behaves asymptotically periodic.This paper was written during the authors stay at the Mathematisches Institut der Universität Tübingen. The first author was supported by Virtugrade Baden-Württenberg and the second by the Marie Curie Host Fellowship Spectral theory for evolution equations contract number HPMT-CT-2001-00315. Both authors thank Rainer Nagel for many helpful discussions.     

Minimaxtheoreme und das Integraldarstellungsproblem

In the present paper conditions for the strict determinateness of two-person zero-sum games are considered. In order to get such minimax theorems we first study games with concave-convex pay-off function. If a game does not have this convexity property one usually passes to a mixed extension where both players are allowed to use probability measures (-additive randomizations) or, more generally, probability contents (finitely additive randomizations) as mixed strategies. By means of a very general minimax theorem for such finitely additive randomizations it can be shown that the problem of strict determinateness of -additive randomizations is equivalent to an integral representation problem. The latter is investigated in the last paragraph.

---

---

Diese Arbeit enthält einen Teil der Ergebnisse der Habilitationsschrift des Verfassers.     

Extensional Σ-Spaces in Type Theory

Synthetic Domain Theory provides a setting for denotational semantics following Dana Scott's slogan domains as sets in which all functions are continuous. Several approaches can be found in the literature, but they are either model-dependent or if they use an axiomatic setting then not uniformly and not explicitly. We present a completely logical approach to Synthetic Domain Theory (SDT), axiomatizing (complete) Extensional PERs. On these grounds some basic domain theory is developed. Special attention is devoted to admissibility. The axiomatic approach is advantageous since it allows for easy formalization and comparison to other axiomatic settings.The consistency of the theory is shown by providing an appropriate realizability model. It is discussed how to get from this special kind of SDT {à la Scott} to a more general form which unifies several approaches.