Related papers: Infinitary Refinement Types for Temporal Propertie…
Application of the so-called refined algebraic quantization scheme for constrained systems to the relativistic particle provides an inner product that defines a unique Fock representation for a scalar field in curved space-time. The…
Recently, various non-classical properties of quantum states and channels have been characterized through an advantage they provide in specific quantum information tasks over their classical counterparts. Such advantage can be typically…
We obtain results on mixing for a large class of (not necessarily Markov) infinite measure semiflows and flows. Erickson proved, amongst other things, a strong renewal theorem in the corresponding i.i.d. setting. Using operator renewal…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
Inductive and coinductive types are commonly construed as ontological (Church-style) types, denoting canonical data-sets such as natural numbers, lists, and streams. For various purposes, notably the study of programs in the context of…
We relax the definition of a string algebra to also include infinite-dimensional algebras such as k[x,y]/(xy). Using the functorial filtration method, which goes back to Gelfand and Ponomarev, we show that finitely generated and artinian…
We consider the joint problem of system identification and inverse optimal control for discrete-time stochastic Linear Quadratic Regulators. We analyze finite and infinite time horizons in a partially observed setting, where the state is…
In the present work, we propose to extend to the Stokes problem a fictitious domain approach inspired by eXtended Finite Element Method and studied for Poisson problem in [Renard]. The method allows computations in domains whose boundaries…
We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable…
In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…
We show a Dvoretsky-Rogers type Theorem for the adapted version of the $q$-summing operators to the topology of the convergence of the vector valued integrals on Banach function spaces. In the pursuit of this objective we prove that the…
We next combine Temporal and Configurational Relationalism's resolution for Field Theory, including in particular for GR. The current Article also provides the finite-and-field theory portmanteau notation, by which the rest of this series'…
A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an…
Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.
Using the spectral properties of orthogonal polynomials, we introduce a finite version of quantum field theory for elementary particles. Closed-loop integrals in the Feynman diagrams for computing transition amplitudes are finite.…
A general theory is developed to study individual based models which are discrete in time. We begin by constructing a Markov chain model that converges to a one-dimensional map in the infinite population limit. Stochastic fluctuations are…
The method of refined algebraic quantization of constrained systems which is based on modification of the inner product of the theory rather than on imposing constraints on the physical states is generalized to the case of constrained…
Consider a stochastic process $\mathfrak{X}$, regenerative at a state $x$ which is instantaneous and regular. Let $L$ be a regenerative local time for $\mathfrak{X}$ at $x$. Suppose furthermore that $\mathfrak{X}$ can be approximated by…
The symmetry approach to the classification of evolution integrable partial differential equations (see, for example \cite{MikShaSok91}) produces an infinite series of functions, defined in terms of the right hand side, that are conserved…