English
Related papers

Related papers: Robustness of Equations Under Operational Extensio…

200 papers

We study bisimulation and context equivalence in a probabilistic $\lambda$-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the…

Programming Languages · Computer Science 2013-11-08 Ugo Dal Lago , Davide Sangiorgi , Michele Alberti

B-terms are built from the B combinator alone defined by B f g x = f (g x), which is well-known as a function composition operator. This paper investigates an interesting property of B-terms, that is, whether repetitive right applications…

Logic in Computer Science · Computer Science 2019-03-11 Mirai Ikebuchi , Keisuke Nakano

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…

Logic · Mathematics 2016-12-19 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

Over the past two decades, open systems that are described by a non-Hermitian Hamiltonian have become a subject of intense research. These systems encompass classical wave systems with balanced gain and loss, semiclassical models with mode…

Quantum Physics · Physics 2021-10-27 Frantisek Ruzicka , Kaustubh S. Agarwal , Yogesh N. Joglekar

A common assumption in modern microeconomic theory is that choice should be rationalizable via a binary preference relation, which \citeauthor{Sen71a} showed to be equivalent to two consistency conditions, namely $\alpha$ (contraction) and…

Multiagent Systems · Computer Science 2025-07-22 Felix Brandt , Paul Harrenstein

Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full…

Logic in Computer Science · Computer Science 2010-02-16 F. J. López-Fraguas , J. Rodríguez-Hortalá

We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…

Category Theory · Mathematics 2009-01-30 Michael Pfender

We set up a parametrised monadic translation for a class of call-by-value functional languages, and prove a corresponding soundness theorem. We then present a series of concrete instantiations of our translation, demonstrating that a number…

Logic in Computer Science · Computer Science 2023-06-22 Thomas Powell

The robustness property of exponential dichotomies refers to the stability of this notion under small linear perturbations. In recent work~\cite{PPX}, the authors have identified a new class of perturbations under which the notion of a…

Dynamical Systems · Mathematics 2025-12-16 Davor Dragicevic

In the present paper, we obtain a more general conditions for univalence of analytic functions in the open unit disk U. Also, we obtain a refinement to a quasiconformal extension criterion of the main result.

Complex Variables · Mathematics 2013-02-19 Murat Çağlar , Halit Orhan

Let H be a complex Hilbert space, B(H) and S(H) be the spaces of all bounded operators and all self-adjoint operators on H, respectively. We give the concrete forms of the maps on B(H) and also S(H) which preserve the spectrum of certain…

Functional Analysis · Mathematics 2013-09-17 Ali Taghavi , Roja Hosseinzadeh

The problem of estimating the frequencies of an exponential sum has been studied extensively over the last years. It can be understood as a sparse estimation problem, as it strives to identify the sparse representation of a signal using…

Numerical Analysis · Mathematics 2019-05-21 Benedikt Diederichs

We study possible noncommutative (operator algebra) variants of the classical Hoffman-Rossi theorem from the theory of function algebras. In particular we give a condition on the range of a contractive weak* continuous homomorphism defined…

Operator Algebras · Mathematics 2019-05-21 David P. Blecher , Luis C. Flores , Beate G. Zimmer

Let $\bx_j = \btheta +\bep_j, j=1,...,n$, be observations of an unknown parameter $\btheta$ in a Euclidean or separable Hilbert space $\scrH$, where $\bep_j$ are noises as random elements in $\scrH$ from a general distribution. We study the…

Statistics Theory · Mathematics 2022-01-03 Fan Zhou , Ping Li , Cun-Hui Zhang

A Hopf bifurcation theorem is established for the abstract evolution equation $\frac{\mathrm{d}x}{\mathrm{d}t}=F(x,\lambda)$ in infinite dimensions under the degeneracy condition $Re \mu ^{\prime}(\lambda_0)= 0$ and suitable assumptions.…

Functional Analysis · Mathematics 2022-04-26 Hongjing Pan , Ruixiang Xing , Zhannan Zhuang

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…

Logic in Computer Science · Computer Science 2023-06-22 James Laird

In acoustics, higher-order-in-time equations arise when taking into account a class of thermal relaxation laws in the modeling of sound wave propagation. In this work, we analyze initial boundary value problems for a family of such…

Analysis of PDEs · Mathematics 2023-02-16 Mostafa Meliani

This paper investigates coherent-like conditions and related properties that a trivial extension might inherit from the ground ring over some classes of modules. It captures previous results dealing primarily with coherence, and also…

Commutative Algebra · Mathematics 2007-05-23 S. Kabbaj , N. Mahdou

The equilibrium properties of an open harmonic oscillator are considered in three steps: First the creation and destruction operators are generalized for open dynamics and the creation operator is used to construct coherent states. The…

Quantum Physics · Physics 2020-06-24 Janos Polonyi

This paper shows how we can make use of an asynchronous transition system, whose transitions are labelled with events and which is equipped with a notion of independence of events, to define non-interleaving semantics for the applied…

Logic in Computer Science · Computer Science 2022-09-13 Clément Aubert , Ross Horne , Christian Johansen