相关论文: Punctually Standard and Nonstandard Models of Natu…
We study the possibility to reconstruct the primordial function for some periodic function. The procedure includes an analytical continuation of a discrete function for Fourier coefficients computation, that introduces an ambiguity. To…
The class of Schur-Agler functions over a domain ${\mathcal D} \subset {\mathbb C}^{d}$ is defined as the class of holomorphic operator-valued functions on ${\mathcal D}$ for which a certain von Neumann inequality is satisfied when a…
In this paper, we consider rational functions $f$ with some minor restrictions over the finite field $\mathbb{F}_{q^n},$ where $q=p^k$ for some prime $p$ and positive integer $k$. We establish a sufficient condition for the existence of a…
In a seminal article, Kahn has introduced the notion of process network and given a semantics for those using Scott domains whose elements are (possibly infinite) sequences of values. This model has since then become a standard tool for…
The sequential analysis of series often requires nonparametric procedures, where the most powerful ones frequently use rank transformations. Re-ranking the data sequence after each new observation can become too intensive computationally.…
If the non-zero finite floating-point numbers are interpreted as point intervals, then the effect of rounding can be interpreted as computing one of the bounds of the result according to interval arithmetic. We give an interval…
Describing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can be represented (or…
We study termination of higher-order probabilistic functional programs with recursion, stochastic conditioning and sampling from continuous distributions. Reasoning about the termination probability of programs with continuous distributions…
We investigate program equivalence for linear higher-order(sequential) languages endowed with primitives for computational effects. More specifically, we study operationally-based notions of program equivalence for a linear…
In this article we introduced algebraic sieves, i.e. selection procedures on a given finite set to extract a particular subset. Such procedures are performed by finite groups acting on the set. They are called sieves because there are…
The present article is devoted to functions from a certain subclass of non-differentiable functions. The arguments and values of considered functions represented by the s-adic representation or the nega-s-adic representation of real…
In this paper we present a novel termination order the {\em predicative lexicographic path order} (PLPO for short), a syntactic restriction of the lexicographic path order. As well as lexicographic path orders, several non-trivial primitive…
Sublinear functionals of random variables are known as sublinear expectations; they are convex homogeneous functionals on infinite-dimensional linear spaces. We extend this concept for set-valued functionals defined on measurable set-valued…
Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…
We study projections in the bidual of a $C^*$-algebra $B$ that are null with respect to a subalgebra $A$, that is projections $p\in B^{**}$ satisfying $|\phi|(p)=0$ for every $\phi\in B^*$ annihilating $A$. In the separable case, $A$-null…
As suggested by the title, the aim of this paper is to uncover the vast computational content of classical Nonstandard Analysis. To this end, we formulate a template $\mathfrak{CI}$ which converts a theorem of 'pure' Nonstandard Analysis,…
We examine residual evaluation, perhaps the most basic operation in numerical simulation. By raising the level of abstraction in this operation, we can eliminate specialized code, enable optimization, and greatly increase the extensibility…
Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…
We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…
Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering.…