Related papers: Revisiting the conservativity of fixpoints over in…
This paper is a follow-up to "Models of PT${}^-$ with internal induction for total formulae." We give a strenghtening of the main result on the semantical non-conservativity of the theory of PT${}^-$ with internal induction for total…
Recently, Dixit et al. established a very elegant generalization of Hardy's Theorem concerning the infinitude of zeros that the Riemann zeta function possesses at its critical line. By introducing a general transformation formula for the…
This paper deals with three tools to compare proof-theoretic strength of formal arithmetical theories: interpretability, $\Pi^0_1$-conservativity and proving restricted consistency. It is well known that under certain conditions these three…
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…
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,…
It was shown by Visser that Peano Arithmetic has the property that any two bi-interpretable extensions of it (in the same language) are equivalent. Enayat proposed to refer to this property of a theory as tightness and to carry out a more…
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…
We attempt to characterize irreversibility of a dynamical system from the existence of different forward and backward mathematical representations depending on the direction of the time arrow. Such different representations have been…
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below…
We study the problem of solving fixed-point equations for seminorm-contractive operators and establish foundational results on the non-asymptotic behavior of iterative algorithms in both deterministic and stochastic settings. Specifically,…
Works of Hooley and Heath-Brown imply a near-optimal bound on the number $N$ of integral solutions to $x_1^3+\dots+x_6^3 = 0$ in expanding regions, conditional on automorphy and GRH for certain Hasse--Weil $L$-functions; for regions of…
We prove two generalizations of results proved by Bruhat and Tits involving metrical completeness and R-buildings. Firstly, we give a generalization of the Bruhat-Tits fixed point theorem also valid for non-complete R-buildings, but with…
We examine the classical/intuitionist divide, and how it reflects on modern theories of infinitesimals. When leading intuitionist Heyting announced that "the creation of non-standard analysis is a standard model of important mathematical…
Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…
We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…
We study a generalization of the notion of conservativity spectrum of an arithmetical theory to a language with transfinitely many truth definitions. We establish a correspondence of conservativity spectra and points of a generalized…
In the 1970s, Fathi, having proven that the group of compactly supported volume-preserving homeomorphisms of the $n$-ball is simple for $n \ge 3$, asked if the same statement holds in dimension $2$. We show that the group of compactly…
In the present paper, based on the previous work (Part I), we present a game semantics for the intensional variant of intuitionistic type theory that refutes the principle of uniqueness of identity proofs and validates the univalence axiom,…
Intuitionistic epistemic logic introduces an epistemic operator, which reflects the intended BHK semantics of intuitionism, to intuitionistic logic. The fundamental assumption concerning intuitionistic knowledge and belief is that it is the…
In this work, we consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide automated algorithms that obtain both lower and upper bounds on…