Related papers: Friedman-reflexivity: interpreters as consistoids
A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
This note describes Fatou's lemma and Lebesgue's dominated convergence theorem for a sequence of measures converging weakly to a finite measure and for a sequence of functions whose negative parts are uniformly integrable with respect to…
Supervaluational fixed-point theories of formal truth aim to amend an important shortcoming of fixed-point theories based on the Strong Kleene logic, namely, accounting for the truth of classical validities. In a celebrated paper, Andrea…
For a subshift $(X, \sigma_X)$ and a subadditive sequence $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on $X$, we study equivalent conditions for the existence of $h\in C(X)$ such that $\lim_{n\rightarrow\infty}(1/{n})\int \log f_n d \mu=\int…
We prove the theorem of linearized asymptotic stability for fractional differential equations. More precisely, we show that an equilibrium of a nonlinear Caputo fractional differential equation is asymptotically stable if its linearization…
A strategy for proving Riemann hypothesis is suggested. The vanishing of the Rieman Zeta reduces to an orthogonality condition for the eigenfunctions of a non-Hermitian operator $D^+$ having the zeros of Riemann Zeta as its eigenvalues. The…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
The rule $\mathrm{Defeated}(x) \leftarrow \mathrm{Attacks}(y,x),\, \neg \, \mathrm{Defeated}(y)$, evaluated under the well-founded semantics (WFS), yields a unique 3-valued (skeptical) solution of an abstract argumentation framework (AF).…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
Representation stability is a theory describing a way in which a sequence of representations of different groups is related, and essentially contains a finite amount of information. Starting with Church-Ellenberg-Farb's theory of…
Focusing, introduced by Jean-Marc Andreoli in the context of classical linear logic, defines a normal form for sequent calculus derivations that cuts down on the number of possible derivations by eagerly applying invertible rules and…
We prove that generically in $\text{Diff}^{1}_{m}(M)$, if an expanding $f$-invariant foliation $W$ of dimension $u$ is minimal and there is a periodic point of unstable index $u$, the foliation is stably minimal. By this we mean there is a…
An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of…
We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…
In [2], Bowen showed that for an expansive system (X, T) with specification and a potential with the Bowen property, the equilibrium state is unique and fully supported. We generalize that result by showing that the same conclusion holds…
In this paper, we show a series of abstract results on fixed point regularity with respect to a parameter. They are based on a Taylor development taking into account a loss of regularity phenomenon, typically occurring for composition…
Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…
Owing to its simplicity and efficiency, the Sherman-Morrison (SM) formula has seen widespread use across various scientific and engineering applications for solving rank-one perturbed linear systems of the form $(A+uv^T)x = b$. Although the…
The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…