Related papers: A note on Hjorth's oscillation theorem
This note makes the obvious observation that Hoeffding's original proof of his inequality remains valid in the game-theoretic framework. All details are spelled out for the convenience of future reference.
Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
Lin and Zhaos theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the…
Motivated by bifurcation of branches of homoclinic orbits of dynamical systems, we consider families of first-order equations on the real line and introduce a generalisation of previous index theorems by Pejsachowicz, and by Hu and…
In a posteriori error analysis, the relationship between error and estimator is usually spoiled by so-called oscillation terms, which cannot be bounded by the error. In order to remedy, we devise a new approach where the oscillation has the…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
In [8] (Nakagawa, et.al., IEEE Trans. IT, 2021), we investigated the convergence speed of the Arimoto-Blahut algorithm. In [8], the convergence of the order $O(1/N)$ was analyzed by focusing on the second-order nonlinear recurrence formula…
The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…
We prove the presence of chaos near a homoclinic orbit in the modified Li-Yorke sense [10] by implementing chaotic perturbations. A Duffing oscillator is considered to show the effectiveness of our technique, and simulations that support…
In this paper we expound some basic ideas of proof theory for theories of ordinals such that there are many stable ordinals below the ordinals.
Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…
We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.
We approximate an elliptic problem with oscillatory coefficients using a problem of the same type, but with constant coefficients. We deliberately take an engineering perspective, where the information on the oscillatory coefficients in the…
The superintegrability of a rational harmonic oscillator (non-central harmonic oscillator with rational ratio of frequencies) with non-linear "centrifugal" terms is studied. In the first part, the system is directly studied in the Euclidean…
Based on the recently proposed framework of general relativistic stochastic mechanics [{\em J. Stat. Phys.}, 190:193, 2023; {\em J. Stat. Phys.}, 190:181, 2023] and stochastic thermodynamics [{\em SciPost Physics Core} 7, 082, 2024] at the…
The problem of ordering operators has afflicted quantum mechanics since its foundation. Several orderings have been devised, but a systematic procedure to move from one ordering to another is still missing. The importance of establishing…
A theorem is proved to verify incremental stability of a feedback system via a homotopy from a known incrementally stable system. A first corollary of that result is that incremental stability may be verified by separation of Scaled…
We show that an elementary proof of Fermat's Last Theorem (FLT) exists. Our paper also extends the scope of FLT from integers to all rational numbers.
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…