Related papers: A note on Hjorth's oscillation theorem
We show that the intuitionistic first-order theory of equality has continuum many complete extensions. We also study the Vitali equivalence relation and show there are many intuitionistically precise versions of it.
Recently the ``Fluctuation theorem'' has been criticized and incorrect incorrect contents have been atributed to it. Here I reestablish and comment the original statements.
The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…
In this note we give a wellfoundedness proof of a computable notation system for first-order reflection.
We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We…
We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…
A simple formal recasting of well known arguments concerning the ordering problems of General Relativity allows to obtain in such a context a Gr\"{o}enewald Van Hove like theorem.
We introduce a fragment of continuous first-order logic, analogue of Palyutin formulas (or h-formulas) in classical model theory, which is preserved under reduced products in both directions. We use it to extend classical results on…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…
We demonstrate the use of the Lorentz reciprocal theorem in obtaining corrections to the steady flow rate due to flow oscillations in rigid channels. Starting from the unsteady Stokes equations, we derive the suitable reciprocity relation,…
In this chapter we give a basic overview of known results regarding Craig interpolation for first-order logic as well as for fragments of first-order logic. Our aim is to provide an entry point into the literature on interpolation theorems…
It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…
We study a notion of generalized H\"older continuity for functions on $\mathbb{R}^d$. We show that for any bounded function $f$ of bounded support and any $r>0$, the $r$-oscillation of $f$ defined as $osc_r f (x):= \sup_{B_r(x)} f -…
This paper studies a first-order expansion of a combination C+J of intuitionistic and classical propositional logic, which was studied by Humberstone (1979) and del Cerro and Herzig (1996), from a proof-theoretic viewpoint. While C+J has…
In this paper we prove a Robinson consistency theorem for a class of many-sorted hybrid logics as a consequence of an Omitting Types Theorem. An important corollary of this result is an interpolation theorem.
We discuss Jordan's theorem on finite subgroups of invertible matrices and give an account of his original proof.
We give a new simpler proof of a theorem of Jayne and Rogers.
In this paper we analyze the oscillation of functions having derivatives in the H\"older or Zygmund class in terms of generalized differences and prove that its growth is governed by a version of the classical Kolmogorov's Law of the…
We give a simplified proof and an improvement of a recent theorem by A. Grigoriev, placing an upper bound for the number of roots of linear combinations of solutions to systems of linear equations with polynomial or rational coefficients.