We give novel computationally effective limit theorems for the convergence of the Cesaro-
means of certain sequences of random variables. These results are intimately related to …

Abstract We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints
of asymptotically weakly contractive map**s, with a focus on providing generalized …

We give a computational interpretation to an abstract formulation of Krull's theorem, by
analysing its classical proof based on Zorn's lemma. Our approach is inspired by proof …

We examine the convergence properties of sequences of nonnegative real numbers that
satisfy a particular class of recursive inequalities, from the perspective of proof theory and …

Elimination of unknowns in systems of equations, starting with Gaussian elimination, is a
problem of general interest. The problem of finding an a priori upper bound for the number of …

What do ultraproducts remember about the original structures? Page 1 Computable structures
corner What do ultraproducts remember about the original structures? HENRY TOWSNER …

In this dissertation we discuss several forms of proof interpretation based on examples in
algebra and analysis. Our main goal is the construction of algorithms or functions out of …

Consider an algorithm computing in a differential field with several commuting derivations
such that the only operations it performs with the elements of the field are arithmetic …

Invariant sets are a key ingredient for verifying safety and other properties of cyber-physical
systems that mix discrete and continuous dynamics. We adapt the elimination-theoretic …

2023 World Scientific Publishing Company Page 288 2023 World Scientific Publishing Company
https://doi. org/10.1142/9789811245220-0011 Chapter 11 More or Less Uniform Convergence …