Related papers: Friedman-reflexivity: interpreters as consistoids

We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…

We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

We introduce a notion of \emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators $S$ and relations $R$ is \emph{stable} if any map from $S$ to unitaries that approximately satisfies…

In this paper, a fractional derivative with short-term memory properties is defined, which can be viewed as an extension of Caputo fractional derivative. Then, some properties of the short memory fractional derivative are discussed. Also, a…

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

We prove that uniform metastability is equivalent to all closed subspaces being pseudocompact and use this to provide a topological proof of the metatheorem introduced by Caicedo, Duenez and Iovino on uniform metastability and countable…

Using a graph representation of classical logic, the paper shows that the liar or Yablo pattern occurs in every semantic paradox. The core graph theoretic result generalizes theorem of Richardson, showing solvability of finite graphs…

Feedback asymptotic stabilization of control systems is an important topic of control theory and applications. Broadly speaking, if the system $\dot{x} = f(x,u)$ is locally asymptotically stabilizable, then there exists a feedback control…

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

While self-reflection can enhance language model reliability, its underlying mechanisms remain opaque, with existing analyses often yielding correlation-based insights that fail to generalize. To address this, we introduce…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

We prove a motivic stabilization result for the cohomology of the local systems on configuration spaces of varieties over $\mathbb{C}$ attached to character polynomials. Our approach interprets the stabilization as a probabilistic…

Let $N$ be normal subgroup of a finite group $G$, $p$ be a prime, $P$ be a Sylow $p$-subgroup of $G$ and $\theta$ be a $P$-invariant irreducible character of $N$. Suppose that $G/N$ is a $p$-solvable group. In this note we show that,…

This paper studies the limits of recursive classifications in proof theory and program extraction, using the refined $A$-translation as a central example. The refined $A$-translation, due to Berger, Buchholz, and Schwichtenberg, is based on…

A quantitative regularity theory is developed for weak solutions to the parabolic system $$ \partial_t u-\mathrm{div}\,{\boldsymbol{\mathsf A}}(x,t,Du)=0 \quad\text{in }E_T\subset \mathbb{R}^N\times\mathbb{R}, $$ which features the…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

The concept of metastable convergence was identified by Tao;it allows converting theorems about convergence into stronger theorems about uniform convergence. The Uniform Metastability Principle (UMP) states that if $T$ is a theorem about…

We present several results suggesting that the concept of $C^1$-inverse limit stability is free of singularity theory. We describe an example of a $C^1$-inverse stable endomorphism which is robustly transitive with persistent critical set.…