Related papers: Evitable iterates of the consistency operator
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
Promoting a theory with a finite number of terms into an effective field theory with an infinite number of terms worsens simplicity, predictability, falsifiability, and other attributes often favored in theory choice. However, the…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
We study sufficient conditions for stability and recurrence in a class of singularly perturbed stochastic hybrid dynamical systems. The systems considered combine multi-time-scale deterministic continuous-time dynamics, modeled by…
A new set of symmetric correction functions is presented for high-order flux reconstruction, that expands upon, while incorporating, all previous correction function sets and opens the possibility for improved performance. By considering FR…
For an increasing sequence $(T_n)$ of one-parameter semigroups of sub Markovian kernel operators over a Polish space, we study the limit semigroup and prove sufficient conditions for it to be strongly Feller. In particular, we show that the…
This note deals with a problem of the probabilistic Ramsey theory in functional analysis. Given a linear operator $T$ on a Hilbert space with an orthogonal basis, we define the isomorphic structure $\Sigma(T)$ as the family of all subsets…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
The pull-back, push-forward and multiplication of smooth functions can be extended to distributions if their wave front set satisfies some conditions. Thus, it is natural to investigate the topological properties of these operations between…
Monotonicity and recursivity are central assumptions in intertemporal consumption problems under ambiguity. We show that monotone recursive preferences admit both a recursive and an ex-ante representation, and that the certainty equivalent…
This work develops an operator-theoretic and dynamical framework inspired by the Riemann--von Mangoldt formula, chaotic dynamics, and random-matrix models for the Riemann zeta function, without attempting to prove the Riemann Hypothesis.…
We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged operators are systematically investigated, in particular, the…
We construct bisymmetric, strictly increasing binary operations on real intervals which are not continuous. This answers a natural question in the theory of bisymmetric and mean-type operations by showing that continuity may fail for…
We consider the Kirchhoff equation on tori of any dimension and we construct solutions whose Sobolev norms oscillates in a chaotic way on certain long time scales. The chaoticity is encoded in the time between oscillations of the norm,…
The conformal algebra provides powerful constraints, which guarantee that renormalized conformally covariant operators exist in the hypothetical conformal limit of the theory, where the $\beta$-function vanishes. Thus, in this limit also…
Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…