Related papers: Evitable iterates of the consistency operator

We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a…

Let $f:\mathbb{R} \rightarrow \mathbb{R}$ be a function for which we want to take local averages. Assuming we cannot look into the future, the 'average' at time $t$ can only use $f(s)$ for $s \leq t$. A natural way to do so is via a weight…

We prove a strengthened form of convexity for operator monotone decreasing positive functions defined on the positive real numbers. This extends Ando and Hiai's work to allow arbitrary positive maps instead of states (or the identity map),…

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…

Given a monotone convex function on the space of essentially bounded random variables with the Lebesgue property (order continuity), we consider its extension preserving the Lebesgue property to as big solid vector space of random variables…

Let $T$ be the map defined on $\N=\{1,2,3, ...\}$ by $T(n) = \frac{n}{2} $ if $n$ is even and by $T(n) = \frac{3n+1}{2}$ if $n$ is odd. Consider the dynamical system $(\N, 2^{\N}, T,\mu)$ where $\mu$ is the counting measure. This dynamical…

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

We present an illative system I_s of classical higher-order logic with subtyping and basic inductive types. The system I_s allows for direct definitions of partial and general recursive functions, and provides means for handling functions…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

We generalize the phenomenon of continuation from complex anal- ysis to locally operator monotone functions. Along the lines of the egde-of- the-wedge theorem, we prove continuations exist dependent only on geometric features of the domain…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

In a type-theoretic fibration category in the sense of Shulman (representing a dependent type theory with at least 1, Sigma, Pi, and identity types), we define the type of constant functions from A to B. This involves an infinite tower of…

In this paper, strongly $(\alpha,T)$-convex functions, i.e., functions $f:D\to \R$ satisfying the functional inequality $$ f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)-t\alpha\big((1-t)(x-y)\big)-(1-t)\alpha\big(t(y-x)\big)$$ for $x,y\in D$ and $t\in…

We introduce and study a family of robust estimators for the functional logistic regression model whose robustness automatically adapts to the data thereby leading to estimators with high efficiency in clean data and a high degree of…

We study the effective potential for composite operators. Introducing a source coupled to the composite operator, we define the effective potential by a Legendre transformation. We find that in three or fewer dimensions, one can use the…

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…

Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…